Programmable re-order buffer for decompression

ABSTRACT

Examples described herein relate to a decompression engine that can request compressed data to be transferred over a memory bus. In some cases, the memory bus is a width that requires multiple data transfers to transfer the requested data. In a case that requested data is to be presented in-order to the decompression engine, a re-order buffer can be used to store entries of data. When a head-of-line entry is received, the entry can be provided to the decompression engine. When a last entry in a group of one or more entries is received, all entries in the group are presented in-order to the decompression engine. In some examples, a decompression engine can borrow memory resources allocated for use by another memory client to expand a size of re-order buffer available for use. For example, a memory client with excess capacity and a slowest growth rate can be chosen to borrow memory resources from.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No.16/683,024, filed Nov. 13, 2019. The entire specification of which ishereby incorporated herein by reference in its entirety.

FIELD

Embodiments generally to the field of data re-ordering in connectionwith image processing.

RELATED ART

Microprocessors and graphics processing units (GPU) have multipleinternal hardware units as part of different stages of computation.These internal units require data to be fetched from memory and manytimes, these units compete for memory or cache access through commonaccess channels to memory or cache. Some of these units require theirmemory read accesses to be ordered, which may be achieved through areorder buffer (ROB). The number of memory read accesses required foreach memory client varies from time to time during the execution ofworkloads like games or graphics benchmarks. As the requirement ofmemory read accesses for each memory client vary during the execution ofworkloads, multiple memory clients tend to compete for allocation of ROBresources.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of a processing system according to anembodiment.

FIGS. 2A-2D illustrate computing systems and graphics processorsprovided by embodiments described herein.

FIGS. 3A-3C illustrate block diagrams of additional graphics processorand compute accelerator architectures provided by embodiments describedherein.

FIG. 4 is a block diagram of a graphics processing engine of a graphicsprocessor in accordance with some embodiments.

FIGS. 5A-5B illustrate thread execution logic including an array ofprocessing elements employed in a graphics processor core according toembodiments described herein.

FIG. 6 illustrates an additional execution unit, according to anembodiment.

FIG. 7 is a block diagram illustrating a graphics processor instructionformats according to some embodiments.

FIG. 8 is a block diagram of another embodiment of a graphics processor.

FIG. 9A is a block diagram illustrating a graphics processor commandformat according to some embodiments.

FIG. 9B is a block diagram illustrating a graphics processor commandsequence according to an embodiment.

FIG. 10 illustrates an exemplary graphics software architecture for adata processing system according to some embodiments.

FIG. 11A is a block diagram illustrating an IP core development systemthat may be used to manufacture an integrated circuit to performoperations according to an embodiment.

FIG. 11B illustrates a cross-section side view of an integrated circuitpackage assembly, according to some embodiments described herein.

FIG. 11C illustrates a package assembly that includes multiple units ofhardware logic chiplets connected to a substrate.

FIG. 11D illustrates a package assembly including interchangeablechiplets, according to an embodiment.

FIGS. 12, 13A and 13B illustrate exemplary integrated circuits andassociated graphics processors that may be fabricated using one or moreIP cores, according to various embodiments described herein.

FIG. 14 depicts a block diagram of a memory and reorder buffer (ROB)system.

FIG. 15A depicts an example of contents of tracking FIFO, controlinformation, data-present indicators, and data buffer allocated forvarious read requests.

FIGS. 15B-1 to 15B-3 depict an example of use of tracking FIFO anddata-present indicators to provide entries in-order to a decompressor.

FIG. 16A depicts a process that can be used to track receipt of entriesassociated with a read request from memory and buffer data prior toproviding the data, in-order, for access by a decompressor or otherdevice or software.

FIG. 16B depicts a process that can be used to allocate an amount ofmemory space allocated for use to reorder entries prior to making dataavailable for processing by a decompressor.

FIG. 17 shows multiple memory clients making memory access requests andbeing allocated with ROB entries.

FIG. 18 depicts an example of a ROB, before borrowing and afterborrowing by a memory client from a lender memory client.

FIGS. 19A-19C depict a chain-like borrowing scheme for borrowing ROBentries by multiple memory clients from ROB allocation for multiplememory clients.

FIGS. 20A and 20B show stalling that occurs when a memory client triesto borrow from another memory client.

FIG. 21 depicts a process that can be used to share memory resources.

DETAILED DESCRIPTION

In the following description, for the purposes of explanation, numerousspecific details are set forth in order to provide a thoroughunderstanding of the embodiments of the invention described below. Itwill be apparent, however, to one skilled in the art that theembodiments of the invention may be practiced without some of thesespecific details. In other instances, well-known structures and devicesare shown in block diagram form to avoid obscuring the underlyingprinciples of the embodiments of the invention.

System Overview

FIG. 1 is a block diagram of a processing system 100, according to anembodiment. System 100 may be used in a single processor desktop system,a multiprocessor workstation system, or a server system having a largenumber of processors 102 or processor cores 107. In one embodiment, thesystem 100 is a processing platform incorporated within asystem-on-a-chip (SoC) integrated circuit for use in mobile, handheld,or embedded devices such as within Internet-of-things (IoT) devices withwired or wireless connectivity to a local or wide area network.

In one embodiment, system 100 can include, couple with, or be integratedwithin: a server-based gaming platform; a game console, including a gameand media console; a mobile gaming console, a handheld game console, oran online game console. In some embodiments the system 100 is part of amobile phone, smart phone, tablet computing device or mobileInternet-connected device such as a laptop with low internal storagecapacity. Processing system 100 can also include, couple with, or beintegrated within: a wearable device, such as a smart watch wearabledevice; smart eyewear or clothing enhanced with augmented reality (AR)or virtual reality (VR) features to provide visual, audio or tactileoutputs to supplement real world visual, audio or tactile experiences orotherwise provide text, audio, graphics, video, holographic images orvideo, or tactile feedback; other augmented reality (AR) device; orother virtual reality (VR) device. In some embodiments, the processingsystem 100 includes or is part of a television or set top box device. Inone embodiment, system 100 can include, couple with, or be integratedwithin a self-driving vehicle such as a bus, tractor trailer, car, motoror electric power cycle, plane or glider (or any combination thereof).The self-driving vehicle may use system 100 to process the environmentsensed around the vehicle.

In some embodiments, the one or more processors 102 each include one ormore processor cores 107 to process instructions which, when executed,perform operations for system or user software. In some embodiments, atleast one of the one or more processor cores 107 is configured toprocess a specific instruction set 109. In some embodiments, instructionset 109 may facilitate Complex Instruction Set Computing (CISC), ReducedInstruction Set Computing (RISC), or computing via a Very LongInstruction Word (VLIW). One or more processor cores 107 may process adifferent instruction set 109, which may include instructions tofacilitate the emulation of other instruction sets. Processor core 107may also include other processing devices, such as a Digital SignalProcessor (DSP).

In some embodiments, the processor 102 includes cache memory 104.Depending on the architecture, the processor 102 can have a singleinternal cache or multiple levels of internal cache. In someembodiments, the cache memory is shared among various components of theprocessor 102. In some embodiments, the processor 102 also uses anexternal cache (e.g., a Level-3 (L3) cache or Last Level Cache (LLC))(not shown), which may be shared among processor cores 107 using knowncache coherency techniques. A register file 106 can be additionallyincluded in processor 102 and may include different types of registersfor storing different types of data (e.g., integer registers, floatingpoint registers, status registers, and an instruction pointer register).Some registers may be general-purpose registers, while other registersmay be specific to the design of the processor 102.

In some embodiments, one or more processor(s) 102 are coupled with oneor more interface bus(es) 110 to transmit communication signals such asaddress, data, or control signals between processor 102 and othercomponents in the system 100. The interface bus 110, in one embodiment,can be a processor bus, such as a version of the Direct Media Interface(DMI) bus. However, processor busses are not limited to the DMI bus, andmay include one or more Peripheral Component Interconnect buses (e.g.,PCI, PCI express), memory busses, or other types of interface busses. Inone embodiment the processor(s) 102 include an integrated memorycontroller 116 and a platform controller hub 130. The memory controller116 facilitates communication between a memory device and othercomponents of the system 100, while the platform controller hub (PCH)130 provides connections to I/O devices via a local I/O bus.

The memory device 120 can be a dynamic random-access memory (DRAM)device, a static random-access memory (SRAM) device, flash memorydevice, phase-change memory device, or some other memory device havingsuitable performance to serve as process memory. In one embodiment thememory device 120 can operate as system memory for the system 100, tostore data 122 and instructions 121 for use when the one or moreprocessors 102 executes an application or process. Memory controller 116also couples with an optional external graphics processor 118, which maycommunicate with the one or more graphics processors 108 in processors102 to perform graphics and media operations. In some embodiments,graphics, media, and or compute operations may be assisted by anaccelerator 112 which is a coprocessor that can be configured to performa specialized set of graphics, media, or compute operations. Forexample, in one embodiment the accelerator 112 is a matrixmultiplication accelerator used to optimize machine learning or computeoperations. In one embodiment the accelerator 112 is a ray-tracingaccelerator that can be used to perform ray-tracing operations inconcert with the graphics processor 108. In one embodiment, an externalaccelerator 119 may be used in place of or in concert with theaccelerator 112.

In some embodiments a display device 111 can connect to the processor(s)102. The display device 111 can be one or more of an internal displaydevice, as in a mobile electronic device or a laptop device or anexternal display device attached via a display interface (e.g.,DisplayPort, embedded DisplayPort, MIPI, HDMI, etc.). In one embodimentthe display device 111 can be a head mounted display (HMD) such as astereoscopic display device for use in virtual reality (VR) applicationsor augmented reality (AR) applications.

In some embodiments the platform controller hub 130 enables peripheralsto connect to memory device 120 and processor 102 via a high-speed I/Obus. The I/O peripherals include, but are not limited to, an audiocontroller 146, a network controller 134, a firmware interface 128, awireless transceiver 126, touch sensors 125, a data storage device 124(e.g., non-volatile memory, volatile memory, hard disk drive, flashmemory, NAND, 3D NAND, 3D XPoint, etc.). The data storage device 124 canconnect via a storage interface (e.g., SATA) or via a peripheral bus,such as a Peripheral Component Interconnect bus (e.g., PCI, PCIexpress). The touch sensors 125 can include touch screen sensors,pressure sensors, or fingerprint sensors. The wireless transceiver 126can be a Wi-Fi transceiver, a Bluetooth transceiver, or a mobile networktransceiver such as a 3G, 4G, 5G, or Long-Term Evolution (LTE)transceiver. The firmware interface 128 enables communication withsystem firmware, and can be, for example, a unified extensible firmwareinterface (UEFI). The network controller 134 can enable a networkconnection to a wired network. In some embodiments, a high-performancenetwork controller (not shown) couples with the interface bus 110. Theaudio controller 146, in one embodiment, is a multi-channel highdefinition audio controller. In one embodiment the system 100 includesan optional legacy I/O controller 140 for coupling legacy (e.g.,Personal System 2 (PS/2)) devices to the system. The platform controllerhub 130 can also connect to one or more Universal Serial Bus (USB)controllers 142 connect input devices, such as keyboard and mouse 143combinations, a camera 144, or other USB input devices.

It will be appreciated that the system 100 shown is exemplary and notlimiting, as other types of data processing systems that are differentlyconfigured may also be used. For example, an instance of the memorycontroller 116 and platform controller hub 130 may be integrated into adiscreet external graphics processor, such as the external graphicsprocessor 118. In one embodiment the platform controller hub 130 and/ormemory controller 116 may be external to the one or more processor(s)102. For example, the system 100 can include an external memorycontroller 116 and platform controller hub 130, which may be configuredas a memory controller hub and peripheral controller hub within a systemchipset that is in communication with the processor(s) 102.

For example, circuit boards (“sleds”) can be used on which componentssuch as CPUs, memory, and other components are placed are designed forincreased thermal performance. In some examples, processing componentssuch as the processors are located on a top side of a sled while nearmemory, such as DIMMs, are located on a bottom side of the sled. As aresult of the enhanced airflow provided by this design, the componentsmay operate at higher frequencies and power levels than in typicalsystems, thereby increasing performance. Furthermore, the sleds areconfigured to blindly mate with power and data communication cables in arack, thereby enhancing their ability to be quickly removed, upgraded,reinstalled, and/or replaced. Similarly, individual components locatedon the sleds, such as processors, accelerators, memory, and data storagedrives, are configured to be easily upgraded due to their increasedspacing from each other. In the illustrative embodiment, the componentsadditionally include hardware attestation features to prove theirauthenticity.

A data center can utilize a single network architecture (“fabric”) thatsupports multiple other network architectures including Ethernet andOmni-Path. The sleds can be coupled to switches via optical fibers,which provide higher bandwidth and lower latency than typical twistedpair cabling (e.g., Category 5, Category 5e, Category 6, etc.). Due tothe high bandwidth, low latency interconnections and networkarchitecture, the data center may, in use, pool resources, such asmemory, accelerators (e.g., GPUs, graphics accelerators, FPGAs, ASICs,neural network and/or artificial intelligence accelerators, etc.), anddata storage drives that are physically disaggregated, and provide themto compute resources (e.g., processors) on an as needed basis, enablingthe compute resources to access the pooled resources as if they werelocal.

A power supply or source can provide voltage and/or current to system100 or any component or system described herein. In one example, thepower supply includes an AC to DC (alternating current to directcurrent) adapter to plug into a wall outlet. Such AC power can berenewable energy (e.g., solar power) power source. In one example, powersource includes a DC power source, such as an external AC to DCconverter. In one example, power source or power supply includeswireless charging hardware to charge via proximity to a charging field.In one example, power source can include an internal battery,alternating current supply, motion-based power supply, solar powersupply, or fuel cell source.

FIGS. 2A-2D illustrate computing systems and graphics processorsprovided by embodiments described herein. The elements of FIGS. 2A-2Dhaving the same reference numbers (or names) as the elements of anyother figure herein can operate or function in any manner similar tothat described elsewhere herein, but are not limited to such.

FIG. 2A is a block diagram of an embodiment of a processor 200 havingone or more processor cores 202A-202N, an integrated memory controller214, and an integrated graphics processor 208. Processor 200 can includeadditional cores up to and including additional core 202N represented bythe dashed lined boxes. Each of processor cores 202A-202N includes oneor more internal cache units 204A-204N. In some embodiments eachprocessor core also has access to one or more shared cached units 206.The internal cache units 204A-204N and shared cache units 206 representa cache memory hierarchy within the processor 200. The cache memoryhierarchy may include at least one level of instruction and data cachewithin each processor core and one or more levels of shared mid-levelcache, such as a Level 2 (L2), Level 3 (L3), Level 4 (L4), or otherlevels of cache, where the highest level of cache before external memoryis classified as the LLC. In some embodiments, cache coherency logicmaintains coherency between the various cache units 206 and 204A-204N.

In some embodiments, processor 200 may also include a set of one or morebus controller units 216 and a system agent core 210. The one or morebus controller units 216 manage a set of peripheral buses, such as oneor more PCI or PCI express busses. System agent core 210 providesmanagement functionality for the various processor components. In someembodiments, system agent core 210 includes one or more integratedmemory controllers 214 to manage access to various external memorydevices (not shown).

In some embodiments, one or more of the processor cores 202A-202Ninclude support for simultaneous multi-threading. In such embodiment,the system agent core 210 includes components for coordinating andoperating cores 202A-202N during multi-threaded processing. System agentcore 210 may additionally include a power control unit (PCU), whichincludes logic and components to regulate the power state of processorcores 202A-202N and graphics processor 208.

In some embodiments, processor 200 additionally includes graphicsprocessor 208 to execute graphics processing operations. In someembodiments, the graphics processor 208 couples with the set of sharedcache units 206, and the system agent core 210, including the one ormore integrated memory controllers 214. In some embodiments, the systemagent core 210 also includes a display controller 211 to drive graphicsprocessor output to one or more coupled displays. In some embodiments,display controller 211 may also be a separate module coupled with thegraphics processor via at least one interconnect, or may be integratedwithin the graphics processor 208.

In some embodiments, a ring-based interconnect unit 212 is used tocouple the internal components of the processor 200. However, analternative interconnect unit may be used, such as a point-to-pointinterconnect, a switched interconnect, or other techniques, includingtechniques well known in the art. In some embodiments, graphicsprocessor 208 couples with the ring interconnect 212 via an I/O link213.

The exemplary I/O link 213 represents at least one of multiple varietiesof I/O interconnects, including an on package I/O interconnect whichfacilitates communication between various processor components and ahigh-performance embedded memory module 218, such as an eDRAM module. Insome embodiments, each of the processor cores 202A-202N and graphicsprocessor 208 can use embedded memory modules 218 as a shared Last LevelCache.

In some embodiments, processor cores 202A-202N are homogenous coresexecuting the same instruction set architecture. In another embodiment,processor cores 202A-202N are heterogeneous in terms of instruction setarchitecture (ISA), where one or more of processor cores 202A-202Nexecute a first instruction set, while at least one of the other coresexecutes a subset of the first instruction set or a differentinstruction set. In one embodiment, processor cores 202A-202N areheterogeneous in terms of microarchitecture, where one or more coreshaving a relatively higher power consumption couple with one or morepower cores having a lower power consumption. In one embodiment,processor cores 202A-202N are heterogeneous in terms of computationalcapability. Additionally, processor 200 can be implemented on one ormore chips or as an SoC integrated circuit having the illustratedcomponents, in addition to other components.

FIG. 2B is a block diagram of hardware logic of a graphics processorcore 219, according to some embodiments described herein. Elements ofFIG. 2B having the same reference numbers (or names) as the elements ofany other figure herein can operate or function in any manner similar tothat described elsewhere herein, but are not limited to such. Thegraphics processor core 219, sometimes referred to as a core slice, canbe one or multiple graphics cores within a modular graphics processor.The graphics processor core 219 is exemplary of one graphics core slice,and a graphics processor as described herein may include multiplegraphics core slices based on target power and performance envelopes.Each graphics processor core 219 can include a fixed function block 230coupled with multiple sub-cores 221A-221F, also referred to assub-slices, that include modular blocks of general-purpose and fixedfunction logic.

In some embodiments, the fixed function block 230 includes ageometry/fixed function pipeline 231 that can be shared by all sub-coresin the graphics processor core 219, for example, in lower performanceand/or lower power graphics processor implementations. In variousembodiments, the geometry/fixed function pipeline 231 includes a 3Dfixed function pipeline (e.g., 3D pipeline 312 as in FIG. 3 and FIG. 4 ,described below) a video front-end unit, a thread spawner and threaddispatcher, and a unified return buffer manager, which manages unifiedreturn buffers (e.g., unified return buffer 418 in FIG. 4 , as describedbelow).

In one embodiment the fixed function block 230 also includes a graphicsSoC interface 232, a graphics microcontroller 233, and a media pipeline234. The graphics SoC interface 232 provides an interface between thegraphics processor core 219 and other processor cores within a system ona chip integrated circuit. The graphics microcontroller 233 is aprogrammable sub-processor that is configurable to manage variousfunctions of the graphics processor core 219, including thread dispatch,scheduling, and pre-emption. The media pipeline 234 (e.g., mediapipeline 316 of FIG. 3 and FIG. 4 ) includes logic to facilitate thedecoding, encoding, pre-processing, and/or post-processing of multimediadata, including image and video data. The media pipeline 234 implementmedia operations via requests to compute or sampling logic within thesub-cores 221-221F.

In one embodiment the SoC interface 232 enables the graphics processorcore 219 to communicate with general-purpose application processor cores(e.g., CPUs) and/or other components within an SoC, including memoryhierarchy elements such as a shared last level cache memory, the systemRAM, and/or embedded on-chip or on-package DRAM. The SoC interface 232can also enable communication with fixed function devices within theSoC, such as camera imaging pipelines, and enables the use of and/orimplements global memory atomics that may be shared between the graphicsprocessor core 219 and CPUs within the SoC. The SoC interface 232 canalso implement power management controls for the graphics processor core219 and enable an interface between a clock domain of the graphic core219 and other clock domains within the SoC. In one embodiment the SoCinterface 232 enables receipt of command buffers from a command streamerand global thread dispatcher that are configured to provide commands andinstructions to each of one or more graphics cores within a graphicsprocessor. The commands and instructions can be dispatched to the mediapipeline 234, when media operations are to be performed, or a geometryand fixed function pipeline (e.g., geometry and fixed function pipeline231, geometry and fixed function pipeline 237) when graphics processingoperations are to be performed.

The graphics microcontroller 233 can be configured to perform variousscheduling and management tasks for the graphics processor core 219. Inone embodiment the graphics microcontroller 233 can perform graphicsand/or compute workload scheduling on the various graphics parallelengines within execution unit (EU) arrays 222A-222F, 224A-224F withinthe sub-cores 221A-221F. In this scheduling model, host softwareexecuting on a CPU core of an SoC including the graphics processor core219 can submit workloads one of multiple graphic processor doorbells,which invokes a scheduling operation on the appropriate graphics engine.Scheduling operations include determining which workload to run next,submitting a workload to a command streamer, pre-empting existingworkloads running on an engine, monitoring progress of a workload, andnotifying host software when a workload is complete. In one embodimentthe graphics microcontroller 233 can also facilitate low-power or idlestates for the graphics processor core 219, providing the graphicsprocessor core 219 with the ability to save and restore registers withinthe graphics processor core 219 across low-power state transitionsindependently from the operating system and/or graphics driver softwareon the system.

The graphics processor core 219 may have greater than or fewer than theillustrated sub-cores 221A-221F, up to N modular sub-cores. For each setof N sub-cores, the graphics processor core 219 can also include sharedfunction logic 235, shared and/or cache memory 236, a geometry/fixedfunction pipeline 237, as well as additional fixed function logic 238 toaccelerate various graphics and compute processing operations. Theshared function logic 235 can include logic units associated with theshared function logic 420 of FIG. 4 (e.g., sampler, math, and/orinter-thread communication logic) that can be shared by each N sub-coreswithin the graphics processor core 219. The shared and/or cache memory236 can be a last-level cache for the set of N sub-cores 221A-221Fwithin the graphics processor core 219, and can also serve as sharedmemory that is accessible by multiple sub-cores. The geometry/fixedfunction pipeline 237 can be included instead of the geometry/fixedfunction pipeline 231 within the fixed function block 230 and caninclude the same or similar logic units.

In one embodiment the graphics processor core 219 includes additionalfixed function logic 238 that can include various fixed functionacceleration logic for use by the graphics processor core 219. In oneembodiment the additional fixed function logic 238 includes anadditional geometry pipeline for use in position only shading. Inposition-only shading, two geometry pipelines exist, the full geometrypipeline within the geometry/fixed function pipeline 238, 231, and acull pipeline, which is an additional geometry pipeline which may beincluded within the additional fixed function logic 238. In oneembodiment the cull pipeline is a trimmed down version of the fullgeometry pipeline. The full pipeline and the cull pipeline can executedifferent instances of the same application, each instance having aseparate context. Position only shading can hide long cull runs ofdiscarded triangles, enabling shading to be completed earlier in someinstances. For example and in one embodiment the cull pipeline logicwithin the additional fixed function logic 238 can execute positionshaders in parallel with the main application and generally generatescritical results faster than the full pipeline, as the cull pipelinefetches and shades only the position attribute of the vertices, withoutperforming rasterization and rendering of the pixels to the framebuffer. The cull pipeline can use the generated critical results tocompute visibility information for all the triangles without regard towhether those triangles are culled. The full pipeline (which in thisinstance may be referred to as a replay pipeline) can consume thevisibility information to skip the culled triangles to shade only thevisible triangles that are finally passed to the rasterization phase.

In one embodiment the additional fixed function logic 238 can alsoinclude machine-learning acceleration logic, such as fixed functionmatrix multiplication logic, for implementations including optimizationsfor machine learning training or inferencing.

Within each graphics sub-core 221A-221F includes a set of executionresources that may be used to perform graphics, media, and computeoperations in response to requests by graphics pipeline, media pipeline,or shader programs. The graphics sub-cores 221A-221F include multiple EUarrays 222A-222F, 224A-224F, thread dispatch and inter-threadcommunication (TD/IC) logic 223A-223F, a 3D (e.g., texture) sampler225A-225F, a media sampler 206A-206F, a shader processor 227A-227F, andshared local memory (SLM) 228A-228F. The EU arrays 222A-222F, 224A-224Feach include multiple execution units, which are general-purposegraphics processing units capable of performing floating-point andinteger/fixed-point logic operations in service of a graphics, media, orcompute operation, including graphics, media, or compute shaderprograms. The TD/IC logic 223A-223F performs local thread dispatch andthread control operations for the execution units within a sub-core andfacilitate communication between threads executing on the executionunits of the sub-core. The 3D sampler 225A-225F can read texture orother 3D graphics related data into memory. The 3D sampler can readtexture data differently based on a configured sample state and thetexture format associated with a given texture. The media sampler206A-206F can perform similar read operations based on the type andformat associated with media data. In one embodiment, each graphicssub-core 221A-221F can alternately include a unified 3D and mediasampler. Threads executing on the execution units within each of thesub-cores 221A-221F can make use of shared local memory 228A-228F withineach sub-core, to enable threads executing within a thread group toexecute using a common pool of on-chip memory.

FIG. 2C illustrates a graphics processing unit (GPU) 239 that includesdedicated sets of graphics processing resources arranged into multi-coregroups 240A-240N. While the details of only a single multi-core group240A are provided, it will be appreciated that the other multi-coregroups 240B-240N may be equipped with the same or similar sets ofgraphics processing resources.

As illustrated, a multi-core group 240A may include a set of graphicscores 243, a set of tensor cores 244, and a set of ray tracing cores245. A scheduler/dispatcher 241 schedules and dispatches the graphicsthreads for execution on the various cores 243, 244, 245. A set ofregister files 242 store operand values used by the cores 243, 244, 245when executing the graphics threads. These may include, for example,integer registers for storing integer values, floating point registersfor storing floating point values, vector registers for storing packeddata elements (integer and/or floating point data elements) and tileregisters for storing tensor/matrix values. In one embodiment, the tileregisters are implemented as combined sets of vector registers.

One or more combined level 1 (L1) caches and shared memory units 247store graphics data such as texture data, vertex data, pixel data, raydata, bounding volume data, etc., locally within each multi-core group240A. One or more texture units 247 can also be used to performtexturing operations, such as texture mapping and sampling. A Level 2(L2) cache 253 shared by all or a subset of the multi-core groups240A-240N stores graphics data and/or instructions for multipleconcurrent graphics threads. As illustrated, the L2 cache 253 may beshared across a plurality of multi-core groups 240A-240N. One or morememory controllers 248 couple the GPU 239 to a memory 249 which may be asystem memory (e.g., DRAM) and/or a dedicated graphics memory (e.g.,GDDR6 memory).

Input/output (I/O) circuitry 250 couples the GPU 239 to one or more I/Odevices 252 such as digital signal processors (DSPs), networkcontrollers, or user input devices. An on-chip interconnect may be usedto couple the I/O devices 252 to the GPU 239 and memory 249. One or moreI/O memory management units (IOMMUs) 251 of the I/O circuitry 250 couplethe I/O devices 252 directly to the system memory 249. In oneembodiment, the IOMMU 251 manages multiple sets of page tables to mapvirtual addresses to physical addresses in system memory 249. In thisembodiment, the I/O devices 252, CPU(s) 246, and GPU(s) 239 may sharethe same virtual address space.

In one implementation, the IOMMU 251 supports virtualization. In thiscase, it may manage a first set of page tables to map guest/graphicsvirtual addresses to guest/graphics physical addresses and a second setof page tables to map the guest/graphics physical addresses tosystem/host physical addresses (e.g., within system memory 249). Thebase addresses of each of the first and second sets of page tables maybe stored in control registers and swapped out on a context switch(e.g., so that the new context is provided with access to the relevantset of page tables). While not illustrated in FIG. 2C, each of the cores243, 244, 245 and/or multi-core groups 240A-240N may include translationlookaside buffers (TLBs) to cache guest virtual to guest physicaltranslations, guest physical to host physical translations, and guestvirtual to host physical translations.

In one embodiment, the CPUs 246, GPUs 239, and I/O devices 252 areintegrated on a single semiconductor chip and/or chip package. Theillustrated memory 249 may be integrated on the same chip or may becoupled to the memory controllers 248 via an off-chip interface. In oneimplementation, the memory 249 comprises GDDR6 memory which shares thesame virtual address space as other physical system-level memories,although the underlying principles of the invention are not limited tothis specific implementation.

In one embodiment, the tensor cores 244 include a plurality of executionunits specifically designed to perform matrix operations, which are thefundamental compute operation used to perform deep learning operations.For example, simultaneous matrix multiplication operations may be usedfor neural network training and inferencing. The tensor cores 244 mayperform matrix processing using a variety of operand precisionsincluding single precision floating-point (e.g., 32 bits),half-precision floating point (e.g., 16 bits), integer words (16 bits),bytes (8 bits), and half-bytes (4 bits). In one embodiment, a neuralnetwork implementation extracts features of each rendered scene,potentially combining details from multiple frames, to construct ahigh-quality final image.

In deep learning implementations, parallel matrix multiplication workmay be scheduled for execution on the tensor cores 244. The training ofneural networks, in particular, requires a significant number of matrixdot product operations. In order to process an inner-product formulationof an N×N×N matrix multiply, the tensor cores 244 may include at least Ndot-product processing elements. Before the matrix multiply begins, oneentire matrix is loaded into tile registers and at least one column of asecond matrix is loaded each cycle for N cycles. Each cycle, there are Ndot products that are processed.

Matrix elements may be stored at different precisions depending on theparticular implementation, including 16-bit words, 8-bit bytes (e.g.,INT8) and 4-bit half-bytes (e.g., INT4). Different precision modes maybe specified for the tensor cores 244 to ensure that the most efficientprecision is used for different workloads (e.g., such as inferencingworkloads which can tolerate quantization to bytes and half-bytes).

In one embodiment, the ray tracing cores 245 accelerate ray tracingoperations for both real-time ray tracing and non-real-time ray tracingimplementations. In particular, the ray tracing cores 245 include raytraversal/intersection circuitry for performing ray traversal usingbounding volume hierarchies (BVHs) and identifying intersections betweenrays and primitives enclosed within the BVH volumes. The ray tracingcores 245 may also include circuitry for performing depth testing andculling (e.g., using a Z buffer or similar arrangement). In oneimplementation, the ray tracing cores 245 perform traversal andintersection operations in concert with the image denoising techniquesdescribed herein, at least a portion of which may be executed on thetensor cores 244. For example, in one embodiment, the tensor cores 244implement a deep learning neural network to perform denoising of framesgenerated by the ray tracing cores 245. However, the CPU(s) 246,graphics cores 243, and/or ray tracing cores 245 may also implement allor a portion of the denoising and/or deep learning algorithms.

In addition, as described above, a distributed approach to denoising maybe employed in which the GPU 239 is in a computing device coupled toother computing devices over a network or high speed interconnect. Inthis embodiment, the interconnected computing devices share neuralnetwork learning/training data to improve the speed with which theoverall system learns to perform denoising for different types of imageframes and/or different graphics applications.

In one embodiment, the ray tracing cores 245 process all BVH traversaland ray-primitive intersections, saving the graphics cores 243 frombeing overloaded with thousands of instructions per ray. In oneembodiment, each ray tracing core 245 includes a first set ofspecialized circuitries for performing bounding box tests (e.g., fortraversal operations) and a second set of specialized circuitry forperforming the ray-triangle intersection tests (e.g., intersecting rayswhich have been traversed). Thus, in one embodiment, the multi-coregroup 240A can simply launch a ray probe, and the ray tracing cores 245independently perform ray traversal and intersection and return hit data(e.g., a hit, no hit, multiple hits, etc.) to the thread context. Theother cores 243, 244 are freed to perform other graphics or compute workwhile the ray tracing cores 245 perform the traversal and intersectionoperations.

In one embodiment, each ray tracing core 245 includes a traversal unitto perform BVH testing operations and an intersection unit whichperforms ray-primitive intersection tests. The intersection unitgenerates a “hit”, “no hit”, or “multiple hit” response, which itprovides to the appropriate thread. During the traversal andintersection operations, the execution resources of the other cores(e.g., graphics cores 243 and tensor cores 244) are freed to performother forms of graphics work.

In one particular embodiment described below, a hybrid rasterization/raytracing approach is used in which work is distributed between thegraphics cores 243 and ray tracing cores 245.

In one embodiment, the ray tracing cores 245 (and/or other cores 243,244) include hardware support for a ray tracing instruction set such asMicrosoft's DirectX Ray Tracing (DXR) which includes a DispatchRayscommand, as well as ray-generation, closest-hit, any-hit, and missshaders, which enable the assignment of unique sets of shaders andtextures for each object. Another ray tracing platform which may besupported by the ray tracing cores 245, graphics cores 243 and tensorcores 244 is Vulkan 1.1.85. Note, however, that the underlyingprinciples of the invention are not limited to any particular raytracing ISA.

In general, the various cores 245, 244, 243 may support a ray tracinginstruction set that includes instructions/functions for ray generation,closest hit, any hit, ray-primitive intersection, per-primitive andhierarchical bounding box construction, miss, visit, and exceptions.More specifically, one embodiment includes ray tracing instructions toperform the following functions:

-   -   Ray Generation—Ray generation instructions may be executed for        each pixel, sample, or other user-defined work assignment.    -   Closest Hit—A closest hit instruction may be executed to locate        the closest intersection point of a ray with primitives within a        scene.    -   Any Hit—An any hit instruction identifies multiple intersections        between a ray and primitives within a scene, potentially to        identify a new closest intersection point.    -   Intersection—An intersection instruction performs a        ray-primitive intersection test and outputs a result.    -   Per-primitive Bounding box Construction—This instruction builds        a bounding box around a given primitive or group of primitives        (e.g., when building a new BVH or other acceleration data        structure).    -   Miss—Indicates that a ray misses all geometry within a scene, or        specified region of a scene.    -   Visit—Indicates the children volumes a ray will traverse.    -   Exceptions—Includes various types of exception handlers (e.g.,        invoked for various error conditions).

FIG. 2D is a block diagram of general purpose graphics processing unit(GPGPU) 270 that can be configured as a graphics processor and/orcompute accelerator, according to embodiments described herein. TheGPGPU 270 can interconnect with host processors (e.g., one or moreCPU(s) 246) and memory 271, 272 via one or more system and/or memorybusses. In one embodiment the memory 271 is system memory that may beshared with the one or more CPU(s) 246, while memory 272 is devicememory that is dedicated to the GPGPU 270. In one embodiment, componentswithin the GPGPU 270 and device memory 272 may be mapped into memoryaddresses that are accessible to the one or more CPU(s) 246. Access tomemory 271 and 272 may be facilitated via a memory controller 268. Inone embodiment the memory controller 268 includes an internal directmemory access (DMA) controller 269 or can include logic to performoperations that would otherwise be performed by a DMA controller.

The GPGPU 270 includes multiple cache memories, including an L2 cache253, L1 cache 254, an instruction cache 255, and shared memory 256, atleast a portion of which may also be partitioned as a cache memory. TheGPGPU 270 also includes multiple compute units 260A-260N. Each computeunit 260A-260N includes a set of vector registers 261, scalar registers262, vector logic units 263, and scalar logic units 264. The computeunits 260A-260N can also include local shared memory 265 and a programcounter 266. The compute units 260A-260N can couple with a constantcache 267, which can be used to store constant data, which is data thatwill not change during the run of kernel or shader program that executeson the GPGPU 270. In one embodiment the constant cache 267 is a scalardata cache and cached data can be fetched directly into the scalarregisters 262.

During operation, the one or more CPU(s) 246 can write commands intoregisters or memory in the GPGPU 270 that has been mapped into anaccessible address space. The command processors 257 can read thecommands from registers or memory and determine how those commands willbe processed within the GPGPU 270. A thread dispatcher 258 can then beused to dispatch threads to the compute units 260A-260N to perform thosecommands Each compute unit 260A-260N can execute threads independentlyof the other compute units. Additionally, each compute unit 260A-260Ncan be independently configured for conditional computation and canconditionally output the results of computation to memory. The commandprocessors 257 can interrupt the one or more CPU(s) 246 when thesubmitted commands are complete.

FIGS. 3A-3C illustrate block diagrams of additional graphics processorand compute accelerator architectures provided by embodiments describedherein. The elements of FIGS. 3A-3C having the same reference numbers(or names) as the elements of any other figure herein can operate orfunction in any manner similar to that described elsewhere herein, butare not limited to such.

FIG. 3A is a block diagram of a graphics processor 300, which may be adiscrete graphics processing unit, or may be a graphics processorintegrated with a plurality of processing cores, or other semiconductordevices such as, but not limited to, memory devices or networkinterfaces. In some embodiments, the graphics processor communicates viaa memory mapped I/O interface to registers on the graphics processor andwith commands placed into the processor memory. In some embodiments,graphics processor 300 includes a memory interface 314 to access memory.Memory interface 314 can be an interface to local memory, one or moreinternal caches, one or more shared external caches, and/or to systemmemory.

In some embodiments, graphics processor 300 also includes a displaycontroller 302 to drive display output data to a display device 318.Display controller 302 includes hardware for one or more overlay planesfor the display and composition of multiple layers of video or userinterface elements. The display device 318 can be an internal orexternal display device. In one embodiment the display device 318 is ahead mounted display device, such as a virtual reality (VR) displaydevice or an augmented reality (AR) display device. In some embodiments,graphics processor 300 includes a video codec engine 306 to encode,decode, or transcode media to, from, or between one or more mediaencoding formats, including, but not limited to Moving Picture ExpertsGroup (MPEG) formats such as MPEG-2, Advanced Video Coding (AVC) formatssuch as H.264/MPEG-4 AVC, H.265/HEVC, Alliance for Open Media (AOMedia)VP8, VP9, as well as the Society of Motion Picture & TelevisionEngineers (SMPTE) 421M/VC-1, and Joint Photographic Experts Group (JPEG)formats such as JPEG, and Motion JPEG (MJPEG) formats.

In some embodiments, graphics processor 300 includes a block imagetransfer (BLIT) engine 304 to perform two-dimensional (2D) rasterizeroperations including, for example, bit-boundary block transfers.However, in one embodiment, 2D graphics operations are performed usingone or more components of graphics processing engine (GPE) 310. In someembodiments, GPE 310 is a compute engine for performing graphicsoperations, including three-dimensional (3D) graphics operations andmedia operations.

In some embodiments, GPE 310 includes a 3D pipeline 312 for performing3D operations, such as rendering three-dimensional images and scenesusing processing functions that act upon 3D primitive shapes (e.g.,rectangle, triangle, etc.). The 3D pipeline 312 includes programmableand fixed function elements that perform various tasks within theelement and/or spawn execution threads to a 3D/Media sub-system 315.While 3D pipeline 312 can be used to perform media operations, anembodiment of GPE 310 also includes a media pipeline 316 that isspecifically used to perform media operations, such as videopost-processing and image enhancement.

In some embodiments, media pipeline 316 includes fixed function orprogrammable logic units to perform one or more specialized mediaoperations, such as video decode acceleration, video de-interlacing, andvideo encode acceleration in place of, or on behalf of video codecengine 306. In some embodiments, media pipeline 316 additionallyincludes a thread spawning unit to spawn threads for execution on3D/Media sub-system 315. The spawned threads perform computations forthe media operations on one or more graphics execution units included in3D/Media sub-system 315.

In some embodiments, 3D/Media subsystem 315 includes logic for executingthreads spawned by 3D pipeline 312 and media pipeline 316. In oneembodiment, the pipelines send thread execution requests to 3D/Mediasubsystem 315, which includes thread dispatch logic for arbitrating anddispatching the various requests to available thread executionresources. The execution resources include an array of graphicsexecution units to process the 3D and media threads. In someembodiments, 3D/Media subsystem 315 includes one or more internal cachesfor thread instructions and data. In some embodiments, the subsystemalso includes shared memory, including registers and addressable memory,to share data between threads and to store output data.

FIG. 3B illustrates a graphics processor 320 having a tiledarchitecture, according to embodiments described herein. In oneembodiment the graphics processor 320 includes a graphics processingengine cluster 322 having multiple instances of the graphics processingengine 310 of FIG. 3A within a graphics engine tile 310A-310D. Eachgraphics engine tile 310A-310D can be interconnected via a set of tileinterconnects 323A-323F. Each graphics engine tile 310A-310D can also beconnected to a memory module or memory device 326A-326D via memoryinterconnects 325A-325D. The memory devices 326A-326D can use anygraphics memory technology. For example, the memory devices 326A-326Dmay be graphics double data rate (GDDR) memory. The memory devices326A-326D, in one embodiment, are high-bandwidth memory (HBM) modulesthat can be on-die with their respective graphics engine tile 310A-310D.In one embodiment the memory devices 326A-326D are stacked memorydevices that can be stacked on top of their respective graphics enginetile 310A-310D. In one embodiment, each graphics engine tile 310A-310Dand associated memory 326A-326D reside on separate chiplets, which arebonded to a base die or base substrate, as described on further detailin FIGS. 11B-11D.

The graphics processing engine cluster 322 can connect with an on-chipor on-package fabric interconnect 324. The fabric interconnect 324 canenable communication between graphics engine tiles 310A-310D andcomponents such as the video codec 306 and one or more copy engines 304.The copy engines 304 can be used to move data out of, into, and betweenthe memory devices 326A-326D and memory that is external to the graphicsprocessor 320 (e.g., system memory). The fabric interconnect 324 canalso be used to interconnect the graphics engine tiles 310A-310D. Thegraphics processor 320 may optionally include a display controller 302to enable a connection with an external display device 318. The graphicsprocessor may also be configured as a graphics or compute accelerator.In the accelerator configuration, the display controller 302 and displaydevice 318 may be omitted.

The graphics processor 320 can connect to a host system via a hostinterface 328. The host interface 328 can enable communication betweenthe graphics processor 320, system memory, and/or other systemcomponents. The host interface 328 can be, for example a PCI express busor another type of host system interface.

FIG. 3C illustrates a compute accelerator 330, according to embodimentsdescribed herein. The compute accelerator 330 can include architecturalsimilarities with the graphics processor 320 of FIG. 3B and is optimizedfor compute acceleration. A compute engine cluster 332 can include a setof compute engine tiles 340A-340D that include execution logic that isoptimized for parallel or vector-based general-purpose computeoperations. In some embodiments, the compute engine tiles 340A-340D donot include fixed function graphics processing logic, although in oneembodiment one or more of the compute engine tiles 340A-340D can includelogic to perform media acceleration. The compute engine tiles 340A-340Dcan connect to memory 326A-326D via memory interconnects 325A-325D. Thememory 326A-326D and memory interconnects 325A-325D may be similartechnology as in graphics processor 320, or can be different. Thegraphics compute engine tiles 340A-340D can also be interconnected via aset of tile interconnects 323A-323F and may be connected with and/orinterconnected by a fabric interconnect 324. In one embodiment thecompute accelerator 330 includes a large L3 cache 336 that can beconfigured as a device-wide cache. The compute accelerator 330 can alsoconnect to a host processor and memory via a host interface 328 in asimilar manner as the graphics processor 320 of FIG. 3B.

Graphics Processing Engine

FIG. 4 is a block diagram of a graphics processing engine 410 of agraphics processor in accordance with some embodiments. In oneembodiment, the graphics processing engine (GPE) 410 is a version of theGPE 310 shown in FIG. 3A, and may also represent a graphics engine tile310A-310D of FIG. 3B. Elements of FIG. 4 having the same referencenumbers (or names) as the elements of any other figure herein canoperate or function in any manner similar to that described elsewhereherein, but are not limited to such. For example, the 3D pipeline 312and media pipeline 316 of FIG. 3A are illustrated. The media pipeline316 is optional in some embodiments of the GPE 410 and may not beexplicitly included within the GPE 410. For example, and in at least oneembodiment, a separate media and/or image processor is coupled to theGPE 410.

In some embodiments, GPE 410 couples with or includes a command streamer403, which provides a command stream to the 3D pipeline 312 and/or mediapipelines 316. In some embodiments, command streamer 403 is coupled withmemory, which can be system memory, or one or more of internal cachememory and shared cache memory. In some embodiments, command streamer403 receives commands from the memory and sends the commands to 3Dpipeline 312 and/or media pipeline 316. The commands are directivesfetched from a ring buffer, which stores commands for the 3D pipeline312 and media pipeline 316. In one embodiment, the ring buffer canadditionally include batch command buffers storing batches of multiplecommands. The commands for the 3D pipeline 312 can also includereferences to data stored in memory, such as but not limited to vertexand geometry data for the 3D pipeline 312 and/or image data and memoryobjects for the media pipeline 316. The 3D pipeline 312 and mediapipeline 316 process the commands and data by performing operations vialogic within the respective pipelines or by dispatching one or moreexecution threads to a graphics core array 414. In one embodiment thegraphics core array 414 include one or more blocks of graphics cores(e.g., graphics core(s) 415A, graphics core(s) 415B), each blockincluding one or more graphics cores. Each graphics core includes a setof graphics execution resources that includes general-purpose andgraphics specific execution logic to perform graphics and computeoperations, as well as fixed function texture processing and/or machinelearning and artificial intelligence acceleration logic.

In various embodiments the 3D pipeline 312 can include fixed functionand programmable logic to process one or more shader programs, such asvertex shaders, geometry shaders, pixel shaders, fragment shaders,compute shaders, or other shader programs, by processing theinstructions and dispatching execution threads to the graphics corearray 414. The graphics core array 414 provides a unified block ofexecution resources for use in processing these shader programs.Multi-purpose execution logic (e.g., execution units) within thegraphics core(s) 415A-414B of the graphic core array 414 includessupport for various 3D API shader languages and can execute multiplesimultaneous execution threads associated with multiple shaders.

In some embodiments, the graphics core array 414 includes executionlogic to perform media functions, such as video and/or image processing.In one embodiment, the execution units include general-purpose logicthat is programmable to perform parallel general-purpose computationaloperations, in addition to graphics processing operations. Thegeneral-purpose logic can perform processing operations in parallel orin conjunction with general-purpose logic within the processor core(s)107 of FIG. 1 or core 202A-202N as in FIG. 2A.

Output data generated by threads executing on the graphics core array414 can output data to memory in a unified return buffer (URB) 418. TheURB 418 can store data for multiple threads. In some embodiments the URB418 may be used to send data between different threads executing on thegraphics core array 414. In some embodiments the URB 418 mayadditionally be used for synchronization between threads on the graphicscore array and fixed function logic within the shared function logic420.

In some embodiments, graphics core array 414 is scalable, such that thearray includes a variable number of graphics cores, each having avariable number of execution units based on the target power andperformance level of GPE 410. In one embodiment the execution resourcesare dynamically scalable, such that execution resources may be enabledor disabled as needed.

The graphics core array 414 couples with shared function logic 420 thatincludes multiple resources that are shared between the graphics coresin the graphics core array. The shared functions within the sharedfunction logic 420 are hardware logic units that provide specializedsupplemental functionality to the graphics core array 414. In variousembodiments, shared function logic 420 includes but is not limited tosampler 421, math 422, and inter-thread communication (ITC) 423 logic.Additionally, some embodiments implement one or more cache(s) 425 withinthe shared function logic 420.

A shared function is implemented at least in a case where the demand fora given specialized function is insufficient for inclusion within thegraphics core array 414. Instead a single instantiation of thatspecialized function is implemented as a stand-alone entity in theshared function logic 420 and shared among the execution resourceswithin the graphics core array 414. The precise set of functions thatare shared between the graphics core array 414 and included within thegraphics core array 414 varies across embodiments. In some embodiments,specific shared functions within the shared function logic 420 that areused extensively by the graphics core array 414 may be included withinshared function logic 416 within the graphics core array 414. In variousembodiments, the shared function logic 416 within the graphics corearray 414 can include some or all logic within the shared function logic420. In one embodiment, all logic elements within the shared functionlogic 420 may be duplicated within the shared function logic 416 of thegraphics core array 414. In one embodiment the shared function logic 420is excluded in favor of the shared function logic 416 within thegraphics core array 414.

Execution Units

FIGS. 5A-5B illustrate thread execution logic 500 including an array ofprocessing elements employed in a graphics processor core according toembodiments described herein. Elements of FIGS. 5A-5B having the samereference numbers (or names) as the elements of any other figure hereincan operate or function in any manner similar to that describedelsewhere herein, but are not limited to such. FIG. 5A-5B illustrates anoverview of thread execution logic 500, which may be representative ofhardware logic illustrated with each sub-core 221A-221F of FIG. 2B. FIG.5A is representative of an execution unit within a general-purposegraphics processor, while FIG. 5B is representative of an execution unitthat may be used within a compute accelerator.

As illustrated in FIG. 5A, in some embodiments thread execution logic500 includes a shader processor 502, a thread dispatcher 504,instruction cache 506, a scalable execution unit array including aplurality of execution units 508A-508N, a sampler 510, shared localmemory 511, a data cache 512, and a data port 514. In one embodiment thescalable execution unit array can dynamically scale by enabling ordisabling one or more execution units (e.g., any of execution units508A, 508B, 508C, 508D, through 508N-1 and 508N) based on thecomputational requirements of a workload. In one embodiment the includedcomponents are interconnected via an interconnect fabric that links toeach of the components. In some embodiments, thread execution logic 500includes one or more connections to memory, such as system memory orcache memory, through one or more of instruction cache 506, data port514, sampler 510, and execution units 508A-508N. In some embodiments,each execution unit (e.g. 508A) is a stand-alone programmablegeneral-purpose computational unit that is capable of executing multiplesimultaneous hardware threads while processing multiple data elements inparallel for each thread. In various embodiments, the array of executionunits 508A-508N is scalable to include any number individual executionunits.

In some embodiments, the execution units 508A-508N are primarily used toexecute shader programs. A shader processor 502 can process the variousshader programs and dispatch execution threads associated with theshader programs via a thread dispatcher 504. In one embodiment thethread dispatcher includes logic to arbitrate thread initiation requestsfrom the graphics and media pipelines and instantiate the requestedthreads on one or more execution unit in the execution units 508A-508N.For example, a geometry pipeline can dispatch vertex, tessellation, orgeometry shaders to the thread execution logic for processing. In someembodiments, thread dispatcher 504 can also process runtime threadspawning requests from the executing shader programs.

In some embodiments, the execution units 508A-508N support aninstruction set that includes native support for many standard 3Dgraphics shader instructions, such that shader programs from graphicslibraries (e.g., Direct 3D and OpenGL) are executed with a minimaltranslation. The execution units support vertex and geometry processing(e.g., vertex programs, geometry programs, vertex shaders), pixelprocessing (e.g., pixel shaders, fragment shaders) and general-purposeprocessing (e.g., compute and media shaders). Each of the executionunits 508A-508N is capable of multi-issue single instruction multipledata (SIMD) execution and multi-threaded operation enables an efficientexecution environment in the face of higher latency memory accesses.Each hardware thread within each execution unit has a dedicatedhigh-bandwidth register file and associated independent thread-state.Execution is multi-issue per clock to pipelines capable of integer,single and double precision floating point operations, SIMD branchcapability, logical operations, transcendental operations, and othermiscellaneous operations. While waiting for data from memory or one ofthe shared functions, dependency logic within the execution units508A-508N causes a waiting thread to sleep until the requested data hasbeen returned. While the waiting thread is sleeping, hardware resourcesmay be devoted to processing other threads. For example, during a delayassociated with a vertex shader operation, an execution unit can performoperations for a pixel shader, fragment shader, or another type ofshader program, including a different vertex shader. Various embodimentscan apply to use execution by use of Single Instruction Multiple Thread(SIMT) as an alternate to use of SIMD or in addition to use of SIMD.Reference to a SIMD core or operation can apply also to SIMT or apply toSIMD in combination with SIMT.

Each execution unit in execution units 508A-508N operates on arrays ofdata elements. The number of data elements is the “execution size,” orthe number of channels for the instruction. An execution channel is alogical unit of execution for data element access, masking, and flowcontrol within instructions. The number of channels may be independentof the number of physical Arithmetic Logic Units (ALUs) or FloatingPoint Units (FPUs) for a particular graphics processor. In someembodiments, execution units 508A-508N support integer andfloating-point data types.

The execution unit instruction set includes SIMD instructions. Thevarious data elements can be stored as a packed data type in a registerand the execution unit will process the various elements based on thedata size of the elements. For example, when operating on a 256-bit widevector, the 256 bits of the vector are stored in a register and theexecution unit operates on the vector as four separate 54-bit packeddata elements (Quad-Word (QW) size data elements), eight separate 32-bitpacked data elements (Double Word (DW) size data elements), sixteenseparate 16-bit packed data elements (Word (W) size data elements), orthirty-two separate 8-bit data elements (byte (B) size data elements).However, different vector widths and register sizes are possible.

In one embodiment one or more execution units can be combined into afused execution unit 509A-509N having thread control logic (507A-507N)that is common to the fused EUs. Multiple EUs can be fused into an EUgroup. Each EU in the fused EU group can be configured to execute aseparate SIMD hardware thread. The number of EUs in a fused EU group canvary according to embodiments. Additionally, various SIMD widths can beperformed per-EU, including but not limited to SIMD8, SIMD16, andSIMD32. Each fused graphics execution unit 509A-509N includes at leasttwo execution units. For example, fused execution unit 509A includes afirst EU 508A, second EU 508B, and thread control logic 507A that iscommon to the first EU 508A and the second EU 508B. The thread controllogic 507A controls threads executed on the fused graphics executionunit 509A, allowing each EU within the fused execution units 509A-509Nto execute using a common instruction pointer register.

One or more internal instruction caches (e.g., 506) are included in thethread execution logic 500 to cache thread instructions for theexecution units. In some embodiments, one or more data caches (e.g.,512) are included to cache thread data during thread execution. Threadsexecuting on the execution logic 500 can also store explicitly manageddata in the shared local memory 511. In some embodiments, a sampler 510is included to provide texture sampling for 3D operations and mediasampling for media operations. In some embodiments, sampler 510 includesspecialized texture or media sampling functionality to process textureor media data during the sampling process before providing the sampleddata to an execution unit.

During execution, the graphics and media pipelines send threadinitiation requests to thread execution logic 500 via thread spawningand dispatch logic. Once a group of geometric objects has been processedand rasterized into pixel data, pixel processor logic (e.g., pixelshader logic, fragment shader logic, etc.) within the shader processor502 is invoked to further compute output information and cause resultsto be written to output surfaces (e.g., color buffers, depth buffers,stencil buffers, etc.). In some embodiments, a pixel shader or fragmentshader calculates the values of the various vertex attributes that areto be interpolated across the rasterized object. In some embodiments,pixel processor logic within the shader processor 502 then executes anapplication programming interface (API)-supplied pixel or fragmentshader program. To execute the shader program, the shader processor 502dispatches threads to an execution unit (e.g., 508A) via threaddispatcher 504. In some embodiments, shader processor 502 uses texturesampling logic in the sampler 510 to access texture data in texture mapsstored in memory. Arithmetic operations on the texture data and theinput geometry data compute pixel color data for each geometricfragment, or discards one or more pixels from further processing.

In some embodiments, the data port 514 provides a memory accessmechanism for the thread execution logic 500 to output processed data tomemory for further processing on a graphics processor output pipeline.In some embodiments, the data port 514 includes or couples to one ormore cache memories (e.g., data cache 512) to cache data for memoryaccess via the data port.

In one embodiment, the execution logic 500 can also include a ray tracer505 that can provide ray tracing acceleration functionality. The raytracer 505 can support a ray tracing instruction set that includesinstructions/functions for ray generation. The ray tracing instructionset can be similar to or different from the ray-tracing instruction setsupported by the ray tracing cores 245 in FIG. 2C.

FIG. 5B illustrates exemplary internal details of an execution unit 508,according to embodiments. A graphics execution unit 508 can include aninstruction fetch unit 537, a general register file array (GRF) 524, anarchitectural register file array (ARF) 526, a thread arbiter 522, asend unit 530, a branch unit 532, a set of SIMD floating point units(FPUs) 534, and in one embodiment a set of dedicated integer SIMD ALUs535. The GRF 524 and ARF 526 includes the set of general register filesand architecture register files associated with each simultaneoushardware thread that may be active in the graphics execution unit 508.In one embodiment, per thread architectural state is maintained in theARF 526, while data used during thread execution is stored in the GRF524. The execution state of each thread, including the instructionpointers for each thread, can be held in thread-specific registers inthe ARF 526.

In one embodiment the graphics execution unit 508 has an architecturethat is a combination of Simultaneous Multi-Threading (SMT) andfine-grained Interleaved Multi-Threading (IMT). The architecture has amodular configuration that can be fine-tuned at design time based on atarget number of simultaneous threads and number of registers perexecution unit, where execution unit resources are divided across logicused to execute multiple simultaneous threads. The number of logicalthreads that may be executed by the graphics execution unit 508 is notlimited to the number of hardware threads, and multiple logical threadscan be assigned to each hardware thread.

In one embodiment, the graphics execution unit 508 can co-issue multipleinstructions, which may each be different instructions. The threadarbiter 522 of the graphics execution unit thread 508 can dispatch theinstructions to one of the send unit 530, branch unit 532, or SIMDFPU(s) 534 for execution. Each execution thread can access 128general-purpose registers within the GRF 524, where each register canstore 32 bytes, accessible as a SIMD 8-element vector of 32-bit dataelements. In one embodiment, each execution unit thread has access to 4Kbytes within the GRF 524, although embodiments are not so limited, andgreater or fewer register resources may be provided in otherembodiments. In one embodiment the graphics execution unit 508 ispartitioned into seven hardware threads that can independently performcomputational operations, although the number of threads per executionunit can also vary according to embodiments. For example, in oneembodiment up to 16 hardware threads are supported. In an embodiment inwhich seven threads may access 4 Kbytes, the GRF 524 can store a totalof 28 Kbytes. Where 16 threads may access 4 Kbytes, the GRF 524 canstore a total of 64 Kbytes. Flexible addressing modes can permitregisters to be addressed together to build effectively wider registersor to represent strided rectangular block data structures.

In one embodiment, memory operations, sampler operations, and otherlonger-latency system communications are dispatched via “send”instructions that are executed by the message passing send unit 530. Inone embodiment, branch instructions are dispatched to a dedicated branchunit 532 to facilitate SIMD divergence and eventual convergence.

In one embodiment the graphics execution unit 508 includes one or moreSIMD floating point units (FPU(s)) 534 to perform floating-pointoperations. In one embodiment, the FPU(s) 534 also support integercomputation. In one embodiment the FPU(s) 534 can SIMD execute up to Mnumber of 32-bit floating-point (or integer) operations, or SIMD executeup to 2M 16-bit integer or 16-bit floating-point operations. In oneembodiment, at least one of the FPU(s) provides extended math capabilityto support high-throughput transcendental math functions and doubleprecision 54-bit floating-point. In some embodiments, a set of 8-bitinteger SIMD ALUs 535 are also present, and may be specificallyoptimized to perform operations associated with machine learningcomputations.

In one embodiment, arrays of multiple instances of the graphicsexecution unit 508 can be instantiated in a graphics sub-core grouping(e.g., a sub-slice). For scalability, product architects can choose theexact number of execution units per sub-core grouping. In one embodimentthe execution unit 508 can execute instructions across a plurality ofexecution channels. In a further embodiment, each thread executed on thegraphics execution unit 508 is executed on a different channel.

FIG. 6 illustrates an additional execution unit 600, according to anembodiment. The execution unit 600 may be a compute-optimized executionunit for use in, for example, a compute engine tile 340A-340D as in FIG.3C, but is not limited as such. Variants of the execution unit 600 mayalso be used in a graphics engine tile 310A-310D as in FIG. 3B. In oneembodiment, the execution unit 600 includes a thread control unit 601, athread state unit 602, an instruction fetch/prefetch unit 603, and aninstruction decode unit 604. The execution unit 600 additionallyincludes a register file 606 that stores registers that can be assignedto hardware threads within the execution unit. The execution unit 600additionally includes a send unit 607 and a branch unit 608. In oneembodiment, the send unit 607 and branch unit 608 can operate similarlyas the send unit 530 and a branch unit 532 of the graphics executionunit 508 of FIG. 5B.

The execution unit 600 also includes a compute unit 610 that includesmultiple different types of functional units. In one embodiment thecompute unit 610 includes an ALU unit 611 that includes an array ofarithmetic logic units. The ALU unit 611 can be configured to perform64-bit, 32-bit, and 16-bit integer and floating point operations.Integer and floating point operations may be performed simultaneously.The compute unit 610 can also include a systolic array 612, and a mathunit 613. The systolic array 612 includes a W wide and D deep network ofdata processing units that can be used to perform vector or otherdata-parallel operations in a systolic manner In one embodiment thesystolic array 612 can be configured to perform matrix operations, suchas matrix dot product operations. In one embodiment the systolic array612 support 16-bit floating point operations, as well as 8-bit and 4-bitinteger operations. In one embodiment the systolic array 612 can beconfigured to accelerate machine learning operations. In suchembodiments, the systolic array 612 can be configured with support forthe bfloat 16-bit floating point format. In one embodiment, a math unit613 can be included to perform a specific subset of mathematicaloperations in an efficient and lower-power manner than then ALU unit611. The math unit 613 can include a variant of math logic that may befound in shared function logic of a graphics processing engine providedby other embodiments (e.g., math logic 422 of the shared function logic420 of FIG. 4 ). In one embodiment the math unit 613 can be configuredto perform 32-bit and 64-bit floating point operations.

The thread control unit 601 includes logic to control the execution ofthreads within the execution unit. The thread control unit 601 caninclude thread arbitration logic to start, stop, and preempt executionof threads within the execution unit 600. The thread state unit 602 canbe used to store thread state for threads assigned to execute on theexecution unit 600. Storing the thread state within the execution unit600 enables the rapid pre-emption of threads when those threads becomeblocked or idle. The instruction fetch/prefetch unit 603 can fetchinstructions from an instruction cache of higher level execution logic(e.g., instruction cache 506 as in FIG. 5A). The instructionfetch/prefetch unit 603 can also issue prefetch requests forinstructions to be loaded into the instruction cache based on ananalysis of currently executing threads. The instruction decode unit 604can be used to decode instructions to be executed by the compute units.In one embodiment, the instruction decode unit 604 can be used as asecondary decoder to decode complex instructions into constituentmicro-operations.

The execution unit 600 additionally includes a register file 606 thatcan be used by hardware threads executing on the execution unit 600.Registers in the register file 606 can be divided across the logic usedto execute multiple simultaneous threads within the compute unit 610 ofthe execution unit 600. The number of logical threads that may beexecuted by the graphics execution unit 600 is not limited to the numberof hardware threads, and multiple logical threads can be assigned toeach hardware thread. The size of the register file 606 can vary acrossembodiments based on the number of supported hardware threads. In oneembodiment, register renaming may be used to dynamically allocateregisters to hardware threads.

FIG. 7 is a block diagram illustrating a graphics processor instructionformats 700 according to some embodiments. In one or more embodiment,the graphics processor execution units support an instruction set havinginstructions in multiple formats. The solid lined boxes illustrate thecomponents that are generally included in an execution unit instruction,while the dashed lines include components that are optional or that areonly included in a sub-set of the instructions. In some embodiments,instruction format 700 described and illustrated are macro-instructions,in that they are instructions supplied to the execution unit, as opposedto micro-operations resulting from instruction decode once theinstruction is processed.

In some embodiments, the graphics processor execution units nativelysupport instructions in a 128-bit instruction format 710. A 64-bitcompacted instruction format 730 is available for some instructionsbased on the selected instruction, instruction options, and number ofoperands. The native 128-bit instruction format 710 provides access toall instruction options, while some options and operations arerestricted in the 64-bit format 730. The native instructions availablein the 64-bit format 730 vary by embodiment. In some embodiments, theinstruction is compacted in part using a set of index values in an indexfield 713. The execution unit hardware references a set of compactiontables based on the index values and uses the compaction table outputsto reconstruct a native instruction in the 128-bit instruction format710. Other sizes and formats of instruction can be used.

For each format, instruction opcode 712 defines the operation that theexecution unit is to perform. The execution units execute eachinstruction in parallel across the multiple data elements of eachoperand. For example, in response to an add instruction the executionunit performs a simultaneous add operation across each color channelrepresenting a texture element or picture element. By default, theexecution unit performs each instruction across all data channels of theoperands. In some embodiments, instruction control field 714 enablescontrol over certain execution options, such as channels selection(e.g., predication) and data channel order (e.g., swizzle). Forinstructions in the 128-bit instruction format 710 an exec-size field716 limits the number of data channels that will be executed inparallel. In some embodiments, exec-size field 716 is not available foruse in the 64-bit compact instruction format 730.

Some execution unit instructions have up to three operands including twosource operands, src0 720, src1 722, and one destination 718. In someembodiments, the execution units support dual destination instructions,where one of the destinations is implied. Data manipulation instructionscan have a third source operand (e.g., SRC2 724), where the instructionopcode 712 determines the number of source operands. An instruction'slast source operand can be an immediate (e.g., hard-coded) value passedwith the instruction.

In some embodiments, the 128-bit instruction format 710 includes anaccess/address mode field 726 specifying, for example, whether directregister addressing mode or indirect register addressing mode is used.When direct register addressing mode is used, the register address ofone or more operands is directly provided by bits in the instruction.

In some embodiments, the 128-bit instruction format 710 includes anaccess/address mode field 726, which specifies an address mode and/or anaccess mode for the instruction. In one embodiment the access mode isused to define a data access alignment for the instruction. Someembodiments support access modes including a 16-byte aligned access modeand a 1-byte aligned access mode, where the byte alignment of the accessmode determines the access alignment of the instruction operands. Forexample, when in a first mode, the instruction may use byte-alignedaddressing for source and destination operands and when in a secondmode, the instruction may use 16-byte-aligned addressing for all sourceand destination operands.

In one embodiment, the address mode portion of the access/address modefield 726 determines whether the instruction is to use direct orindirect addressing. When direct register addressing mode is used bitsin the instruction directly provide the register address of one or moreoperands. When indirect register addressing mode is used, the registeraddress of one or more operands may be computed based on an addressregister value and an address immediate field in the instruction.

In some embodiments instructions are grouped based on opcode 712bit-fields to simplify Opcode decode 740. For an 8-bit opcode, bits 4,5, and 6 allow the execution unit to determine the type of opcode. Theprecise opcode grouping shown is merely an example. In some embodiments,a move and logic opcode group 742 includes data movement and logicinstructions (e.g., move (mov), compare (cmp)). In some embodiments,move and logic group 742 shares the five most significant bits (MSB),where move (mov) instructions are in the form of 0000xxxxb and logicinstructions are in the form of 0001xxxxb. A flow control instructiongroup 744 (e.g., call, jump (jmp)) includes instructions in the form of0010xxxxb (e.g., 0x20). A miscellaneous instruction group 746 includes amix of instructions, including synchronization instructions (e.g., wait,send) in the form of 0011xxxxb (e.g., 0x30). A parallel math instructiongroup 748 includes component-wise arithmetic instructions (e.g., add,multiply (mul)) in the form of 0100xxxxb (e.g., 0x40). The parallel mathgroup 748 performs the arithmetic operations in parallel across datachannels. The vector math group 750 includes arithmetic instructions(e.g., dp4) in the form of 0101xxxxb (e.g., 0x50). The vector math groupperforms arithmetic such as dot product calculations on vector operands.The illustrated opcode decode 740, in one embodiment, can be used todetermine which portion of an execution unit will be used to execute adecoded instruction. For example, some instructions may be designated assystolic instructions that will be performed by a systolic array. Otherinstructions, such as ray-tracing instructions (not shown) can be routedto a ray-tracing core or ray-tracing logic within a slice or partitionof execution logic.

Graphics Pipeline

FIG. 8 is a block diagram of another embodiment of a graphics processor800. Elements of FIG. 8 having the same reference numbers (or names) asthe elements of any other figure herein can operate or function in anymanner similar to that described elsewhere herein, but are not limitedto such.

In some embodiments, graphics processor 800 includes a geometry pipeline820, a media pipeline 830, a display engine 840, thread execution logic850, and a render output pipeline 870. In some embodiments, graphicsprocessor 800 is a graphics processor within a multi-core processingsystem that includes one or more general-purpose processing cores. Thegraphics processor is controlled by register writes to one or morecontrol registers (not shown) or via commands issued to graphicsprocessor 800 via a ring interconnect 802. In some embodiments, ringinterconnect 802 couples graphics processor 800 to other processingcomponents, such as other graphics processors or general-purposeprocessors. Commands from ring interconnect 802 are interpreted by acommand streamer 803, which supplies instructions to individualcomponents of the geometry pipeline 820 or the media pipeline 830.

In some embodiments, command streamer 803 directs the operation of avertex fetcher 805 that reads vertex data from memory and executesvertex-processing commands provided by command streamer 803. In someembodiments, vertex fetcher 805 provides vertex data to a vertex shader807, which performs coordinate space transformation and lightingoperations to each vertex. In some embodiments, vertex fetcher 805 andvertex shader 807 execute vertex-processing instructions by dispatchingexecution threads to execution units 852A-852B via a thread dispatcher831.

In some embodiments, execution units 852A-852B are an array of vectorprocessors having an instruction set for performing graphics and mediaoperations. In some embodiments, execution units 852A-852B have anattached L1 cache 851 that is specific for each array or shared betweenthe arrays. The cache can be configured as a data cache, an instructioncache, or a single cache that is partitioned to contain data andinstructions in different partitions.

In some embodiments, geometry pipeline 820 includes tessellationcomponents to perform hardware-accelerated tessellation of 3D objects.In some embodiments, a programmable hull shader 811 configures thetessellation operations. A programmable domain shader 817 providesback-end evaluation of tessellation output. A tessellator 813 operatesat the direction of hull shader 811 and contains special purpose logicto generate a set of detailed geometric objects based on a coarsegeometric model that is provided as input to geometry pipeline 820. Insome embodiments, if tessellation is not used, tessellation components(e.g., hull shader 811, tessellator 813, and domain shader 817) can bebypassed.

In some embodiments, complete geometric objects can be processed by ageometry shader 819 via one or more threads dispatched to executionunits 852A-852B, or can proceed directly to the clipper 829. In someembodiments, the geometry shader operates on entire geometric objects,rather than vertices or patches of vertices as in previous stages of thegraphics pipeline. If the tessellation is disabled, the geometry shader819 receives input from the vertex shader 807. In some embodiments,geometry shader 819 is programmable by a geometry shader program toperform geometry tessellation if the tessellation units are disabled.

Before rasterization, a clipper 829 processes vertex data. The clipper829 may be a fixed function clipper or a programmable clipper havingclipping and geometry shader functions. In some embodiments, arasterizer and depth test component 873 in the render output pipeline870 dispatches pixel shaders to convert the geometric objects into perpixel representations. In some embodiments, pixel shader logic isincluded in thread execution logic 850. In some embodiments, anapplication can bypass the rasterizer and depth test component 873 andaccess un-rasterized vertex data via a stream out unit 823.

The graphics processor 800 has an interconnect bus, interconnect fabric,or some other interconnect mechanism that allows data and messagepassing amongst the major components of the processor. In someembodiments, execution units 852A-852B and associated logic units (e.g.,L1 cache 851, sampler 854, texture cache 858, etc.) interconnect via adata port 856 to perform memory access and communicate with renderoutput pipeline components of the processor. In some embodiments,sampler 854, caches 851, 858 and execution units 852A-852B each haveseparate memory access paths. In one embodiment the texture cache 858can also be configured as a sampler cache.

In some embodiments, render output pipeline 870 contains a rasterizerand depth test component 873 that converts vertex-based objects into anassociated pixel-based representation. In some embodiments, therasterizer logic includes a windower/masker unit to perform fixedfunction triangle and line rasterization. An associated render cache 878and depth cache 879 are also available in some embodiments. A pixeloperations component 877 performs pixel-based operations on the data,though in some instances, pixel operations associated with 2D operations(e.g. bit block image transfers with blending) are performed by the 2Dengine 841, or substituted at display time by the display controller 843using overlay display planes. In some embodiments, a shared L3 cache 875is available to all graphics components, allowing the sharing of datawithout the use of main system memory.

In some embodiments, graphics processor media pipeline 830 includes amedia engine 837 and a video front-end 834. In some embodiments, videofront-end 834 receives pipeline commands from the command streamer 803.In some embodiments, media pipeline 830 includes a separate commandstreamer. In some embodiments, video front-end 834 processes mediacommands before sending the command to the media engine 837. In someembodiments, media engine 837 includes thread spawning functionality tospawn threads for dispatch to thread execution logic 850 via threaddispatcher 831.

In some embodiments, graphics processor 800 includes a display engine840. In some embodiments, display engine 840 is external to processor800 and couples with the graphics processor via the ring interconnect802, or some other interconnect bus or fabric. In some embodiments,display engine 840 includes a 2D engine 841 and a display controller843. In some embodiments, display engine 840 contains special purposelogic capable of operating independently of the 3D pipeline. In someembodiments, display controller 843 couples with a display device (notshown), which may be a system integrated display device, as in a laptopcomputer, or an external display device attached via a display deviceconnector.

In some embodiments, the geometry pipeline 820 and media pipeline 830are configurable to perform operations based on multiple graphics andmedia programming interfaces and are not specific to any one applicationprogramming interface (API). In some embodiments, driver software forthe graphics processor translates API calls that are specific to aparticular graphics or media library into commands that can be processedby the graphics processor. In some embodiments, support is provided forthe Open Graphics Library (OpenGL), Open Computing Language (OpenCL),and/or Vulkan graphics and compute API, all from the Khronos Group. Insome embodiments, support may also be provided for the Direct3D libraryfrom the Microsoft Corporation. In some embodiments, a combination ofthese libraries may be supported. Support may also be provided for theOpen Source Computer Vision Library (OpenCV). A future API with acompatible 3D pipeline would also be supported if a mapping can be madefrom the pipeline of the future API to the pipeline of the graphicsprocessor.

Graphics Pipeline Programming

FIG. 9A is a block diagram illustrating a graphics processor commandformat 900 according to some embodiments. FIG. 9B is a block diagramillustrating a graphics processor command sequence 910 according to anembodiment. The solid lined boxes in FIG. 9A illustrate the componentsthat are generally included in a graphics command while the dashed linesinclude components that are optional or that are only included in asub-set of the graphics commands. The exemplary graphics processorcommand format 900 of FIG. 9A includes data fields to identify a client902, a command operation code (opcode) 904, and data 906 for the commandA sub-opcode 905 and a command size 908 are also included in somecommands.

In some embodiments, client 902 specifies the client unit of thegraphics device that processes the command data. In some embodiments, agraphics processor command parser examines the client field of eachcommand to condition the further processing of the command and route thecommand data to the appropriate client unit. In some embodiments, thegraphics processor client units include a memory interface unit, arender unit, a 2D unit, a 3D unit, and a media unit. Each client unithas a corresponding processing pipeline that processes the commands Oncethe command is received by the client unit, the client unit reads theopcode 904 and, if present, sub-opcode 905 to determine the operation toperform. The client unit performs the command using information in datafield 906. For some commands an explicit command size 908 is expected tospecify the size of the command In some embodiments, the command parserautomatically determines the size of at least some of the commands basedon the command opcode. In some embodiments commands are aligned viamultiples of a double word. Other command formats can be used.

The flow diagram in FIG. 9B illustrates an exemplary graphics processorcommand sequence 910. In some embodiments, software or firmware of adata processing system that features an embodiment of a graphicsprocessor uses a version of the command sequence shown to set up,execute, and terminate a set of graphics operations. A sample commandsequence is shown and described for purposes of example only asembodiments are not limited to these specific commands or to thiscommand sequence. Moreover, the commands may be issued as batch ofcommands in a command sequence, such that the graphics processor willprocess the sequence of commands in at least partially concurrence.

In some embodiments, the graphics processor command sequence 910 maybegin with a pipeline flush command 912 to cause any active graphicspipeline to complete the currently pending commands for the pipeline. Insome embodiments, the 3D pipeline 922 and the media pipeline 924 do notoperate concurrently. The pipeline flush is performed to cause theactive graphics pipeline to complete any pending commands In response toa pipeline flush, the command parser for the graphics processor willpause command processing until the active drawing engines completepending operations and the relevant read caches are invalidated.Optionally, any data in the render cache that is marked ‘dirty’ can beflushed to memory. In some embodiments, pipeline flush command 912 canbe used for pipeline synchronization or before placing the graphicsprocessor into a low power state.

In some embodiments, a pipeline select command 913 is used when acommand sequence requires the graphics processor to explicitly switchbetween pipelines. In some embodiments, a pipeline select command 913 isrequired only once within an execution context before issuing pipelinecommands unless the context is to issue commands for both pipelines. Insome embodiments, a pipeline flush command 912 is required immediatelybefore a pipeline switch via the pipeline select command 913.

In some embodiments, a pipeline control command 914 configures agraphics pipeline for operation and is used to program the 3D pipeline922 and the media pipeline 924. In some embodiments, pipeline controlcommand 914 configures the pipeline state for the active pipeline. Inone embodiment, the pipeline control command 914 is used for pipelinesynchronization and to clear data from one or more cache memories withinthe active pipeline before processing a batch of commands.

In some embodiments, return buffer state commands 916 are used toconfigure a set of return buffers for the respective pipelines to writedata. Some pipeline operations require the allocation, selection, orconfiguration of one or more return buffers into which the operationswrite intermediate data during processing. In some embodiments, thegraphics processor also uses one or more return buffers to store outputdata and to perform cross thread communication. In some embodiments, thereturn buffer state 916 includes selecting the size and number of returnbuffers to use for a set of pipeline operations.

The remaining commands in the command sequence differ based on theactive pipeline for operations. Based on a pipeline determination 920,the command sequence is tailored to the 3D pipeline 922 beginning withthe 3D pipeline state 930 or the media pipeline 924 beginning at themedia pipeline state 940.

The commands to configure the 3D pipeline state 930 include 3D statesetting commands for vertex buffer state, vertex element state, constantcolor state, depth buffer state, and other state variables that are tobe configured before 3D primitive commands are processed. The values ofthese commands are determined at least in part based on the particular3D API in use. In some embodiments, 3D pipeline state 930 commands arealso able to selectively disable or bypass certain pipeline elements ifthose elements will not be used.

In some embodiments, 3D primitive 932 command is used to submit 3Dprimitives to be processed by the 3D pipeline. Commands and associatedparameters that are passed to the graphics processor via the 3Dprimitive 932 command are forwarded to the vertex fetch function in thegraphics pipeline. The vertex fetch function uses the 3D primitive 932command data to generate vertex data structures. The vertex datastructures are stored in one or more return buffers. In someembodiments, 3D primitive 932 command is used to perform vertexoperations on 3D primitives via vertex shaders. To process vertexshaders, 3D pipeline 922 dispatches shader execution threads to graphicsprocessor execution units.

In some embodiments, 3D pipeline 922 is triggered via an execute 934command or event. In some embodiments, a register write triggers commandexecution. In some embodiments execution is triggered via a ‘go’ or‘kick’ command in the command sequence. In one embodiment, commandexecution is triggered using a pipeline synchronization command to flushthe command sequence through the graphics pipeline. The 3D pipeline willperform geometry processing for the 3D primitives. Once operations arecomplete, the resulting geometric objects are rasterized and the pixelengine colors the resulting pixels. Additional commands to control pixelshading and pixel back end operations may also be included for thoseoperations.

In some embodiments, the graphics processor command sequence 910 followsthe media pipeline 924 path when performing media operations. Ingeneral, the specific use and manner of programming for the mediapipeline 924 depends on the media or compute operations to be performed.Specific media decode operations may be offloaded to the media pipelineduring media decode. In some embodiments, the media pipeline can also bebypassed and media decode can be performed in whole or in part usingresources provided by one or more general-purpose processing cores. Inone embodiment, the media pipeline also includes elements forgeneral-purpose graphics processor unit (GPGPU) operations, where thegraphics processor is used to perform SIMD vector operations usingcomputational shader programs that are not explicitly related to therendering of graphics primitives.

In some embodiments, media pipeline 924 is configured in a similarmanner as the 3D pipeline 922. A set of commands to configure the mediapipeline state 940 are dispatched or placed into a command queue beforethe media object commands 942. In some embodiments, commands for themedia pipeline state 940 include data to configure the media pipelineelements that will be used to process the media objects. This includesdata to configure the video decode and video encode logic within themedia pipeline, such as encode or decode format. In some embodiments,commands for the media pipeline state 940 also support the use of one ormore pointers to “indirect” state elements that contain a batch of statesettings.

In some embodiments, media object commands 942 supply pointers to mediaobjects for processing by the media pipeline. The media objects includememory buffers containing video data to be processed. In someembodiments, all media pipeline states must be valid before issuing amedia object command 942. Once the pipeline state is configured andmedia object commands 942 are queued, the media pipeline 924 istriggered via an execute command 944 or an equivalent execute event(e.g., register write). Output from media pipeline 924 may then be postprocessed by operations provided by the 3D pipeline 922 or the mediapipeline 924. In some embodiments, GPGPU operations are configured andexecuted in a similar manner as media operations.

Graphics Software Architecture

FIG. 10 illustrates an exemplary graphics software architecture for adata processing system 1000 according to some embodiments. In someembodiments, software architecture includes a 3D graphics application1010, an operating system 1020, and at least one processor 1030. In someembodiments, processor 1030 includes a graphics processor 1032 and oneor more general-purpose processor core(s) 1034. The graphics application1010 and operating system 1020 each execute in the system memory 1050 ofthe data processing system.

In some embodiments, 3D graphics application 1010 contains one or moreshader programs including shader instructions 1012. The shader languageinstructions may be in a high-level shader language, such as theHigh-Level Shader Language (HLSL) of Direct3D, the OpenGL ShaderLanguage (GLSL), and so forth. The application also includes executableinstructions 1014 in a machine language suitable for execution by thegeneral-purpose processor core 1034. The application also includesgraphics objects 1016 defined by vertex data.

In some embodiments, operating system 1020 is a Microsoft® Windows®operating system from the Microsoft Corporation, a proprietary UNIX-likeoperating system, or an open source UNIX-like operating system using avariant of the Linux kernel. The operating system 1020 can support agraphics API 1022 such as the Direct3D API, the OpenGL API, or theVulkan API. When the Direct3D API is in use, the operating system 1020uses a front-end shader compiler 1024 to compile any shader instructions1012 in HLSL into a lower-level shader language. The compilation may bea just-in-time (JIT) compilation or the application can perform shaderpre-compilation. In some embodiments, high-level shaders are compiledinto low-level shaders during the compilation of the 3D graphicsapplication 1010. In some embodiments, the shader instructions 1012 areprovided in an intermediate form, such as a version of the StandardPortable Intermediate Representation (SPIR) used by the Vulkan API.

In some embodiments, user mode graphics driver 1026 contains a back-endshader compiler 1027 to convert the shader instructions 1012 into ahardware specific representation. When the OpenGL API is in use, shaderinstructions 1012 in the GLSL high-level language are passed to a usermode graphics driver 1026 for compilation. In some embodiments, usermode graphics driver 1026 uses operating system kernel mode functions1028 to communicate with a kernel mode graphics driver 1029. In someembodiments, kernel mode graphics driver 1029 communicates with graphicsprocessor 1032 to dispatch commands and instructions.

IP Core Implementations

One or more aspects of at least one embodiment may be implemented byrepresentative code stored on a machine-readable medium which representsand/or defines logic within an integrated circuit such as a processor.For example, the machine-readable medium may include instructions whichrepresent various logic within the processor. When read by a machine,the instructions may cause the machine to fabricate the logic to performthe techniques described herein. Such representations, known as “IPcores,” are reusable units of logic for an integrated circuit that maybe stored on a tangible, machine-readable medium as a hardware modelthat describes the structure of the integrated circuit. The hardwaremodel may be supplied to various customers or manufacturing facilities,which load the hardware model on fabrication machines that manufacturethe integrated circuit. The integrated circuit may be fabricated suchthat the circuit performs operations described in association with anyof the embodiments described herein.

FIG. 11A is a block diagram illustrating an IP core development system1100 that may be used to manufacture an integrated circuit to performoperations according to an embodiment. The IP core development system1100 may be used to generate modular, reusable designs that can beincorporated into a larger design or used to construct an entireintegrated circuit (e.g., an SOC integrated circuit). A design facility1130 can generate a software simulation 1110 of an IP core design in ahigh-level programming language (e.g., C/C++). The software simulation1110 can be used to design, test, and verify the behavior of the IP coreusing a simulation model 1112. The simulation model 1112 may includefunctional, behavioral, and/or timing simulations. A register transferlevel (RTL) design 1115 can then be created or synthesized from thesimulation model 1112. The RTL design 1115 is an abstraction of thebehavior of the integrated circuit that models the flow of digitalsignals between hardware registers, including the associated logicperformed using the modeled digital signals. In addition to an RTLdesign 1115, lower-level designs at the logic level or transistor levelmay also be created, designed, or synthesized. Thus, the particulardetails of the initial design and simulation may vary.

The RTL design 1115 or equivalent may be further synthesized by thedesign facility into a hardware model 1120, which may be in a hardwaredescription language (HDL), or some other representation of physicaldesign data. The HDL may be further simulated or tested to verify the IPcore design. The IP core design can be stored for delivery to a 3rdparty fabrication facility 1165 using non-volatile memory 1140 (e.g.,hard disk, flash memory, or any non-volatile storage medium).Alternatively, the IP core design may be transmitted (e.g., via theInternet) over a wired connection 1150 or wireless connection 1160. Thefabrication facility 1165 may then fabricate an integrated circuit thatis based at least in part on the IP core design. The fabricatedintegrated circuit can be configured to perform operations in accordancewith at least one embodiment described herein.

FIG. 11B illustrates a cross-section side view of an integrated circuitpackage assembly 1170, according to some embodiments described herein.The integrated circuit package assembly 1170 illustrates animplementation of one or more processor or accelerator devices asdescribed herein. The package assembly 1170 includes multiple units ofhardware logic 1172, 1174 connected to a substrate 1180. The logic 1172,1174 may be implemented at least partly in configurable logic orfixed-functionality logic hardware, and can include one or more portionsof any of the processor core(s), graphics processor(s), or otheraccelerator devices described herein. Each unit of logic 1172, 1174 canbe implemented within a semiconductor die and coupled with the substrate1180 via an interconnect structure 1173. The interconnect structure 1173may be configured to route electrical signals between the logic 1172,1174 and the substrate 1180, and can include interconnects such as, butnot limited to bumps or pillars. In some embodiments, the interconnectstructure 1173 may be configured to route electrical signals such as,for example, input/output (I/O) signals and/or power or ground signalsassociated with the operation of the logic 1172, 1174. In someembodiments, the substrate 1180 is an epoxy-based laminate substrate.The substrate 1180 may include other suitable types of substrates inother embodiments. The package assembly 1170 can be connected to otherelectrical devices via a package interconnect 1183. The packageinterconnect 1183 may be coupled to a surface of the substrate 1180 toroute electrical signals to other electrical devices, such as amotherboard, other chipset, or multi-chip module.

In some embodiments, the units of logic 1172, 1174 are electricallycoupled with a bridge 1182 that is configured to route electricalsignals between the logic 1172, 1174. The bridge 1182 may be a denseinterconnect structure that provides a route for electrical signals. Thebridge 1182 may include a bridge substrate composed of glass or asuitable semiconductor material. Electrical routing features can beformed on the bridge substrate to provide a chip-to-chip connectionbetween the logic 1172, 1174.

Although two units of logic 1172, 1174 and a bridge 1182 areillustrated, embodiments described herein may include more or fewerlogic units on one or more dies. The one or more dies may be connectedby zero or more bridges, as the bridge 1182 may be excluded when thelogic is included on a single die. Alternatively, multiple dies or unitsof logic can be connected by one or more bridges. Additionally, multiplelogic units, dies, and bridges can be connected together in otherpossible configurations, including three-dimensional configurations.

FIG. 11C illustrates a package assembly 1190 that includes multipleunits of hardware logic chiplets connected to a substrate 1180 (e.g.,base die). A graphics processing unit, parallel processor, and/orcompute accelerator as described herein can be composed from diversesilicon chiplets that are separately manufactured. In this context, achiplet is an at least partially packaged integrated circuit thatincludes distinct units of logic that can be assembled with otherchiplets into a larger package. A diverse set of chiplets with differentIP core logic can be assembled into a single device. Additionally, thechiplets can be integrated into a base die or base chiplet using activeinterposer technology. The concepts described herein enable theinterconnection and communication between the different forms of IPwithin the GPU. IP cores can be manufactured using different processtechnologies and composed during manufacturing, which avoids thecomplexity of converging multiple IPs, especially on a large SoC withseveral flavors IPs, to the same manufacturing process. Enabling the useof multiple process technologies improves the time to market andprovides a cost-effective way to create multiple product SKUs.Additionally, the disaggregated IPs are more amenable to being powergated independently, components that are not in use on a given workloadcan be powered off, reducing overall power consumption.

The hardware logic chiplets can include special purpose hardware logicchiplets 1172, logic or I/O chiplets 1174, and/or memory chiplets 1175.The hardware logic chiplets 1172 and logic or I/O chiplets 1174 may beimplemented at least partly in configurable logic or fixed-functionalitylogic hardware and can include one or more portions of any of theprocessor core(s), graphics processor(s), parallel processors, or otheraccelerator devices described herein. The memory chiplets 1175 can beDRAM (e.g., GDDR, HBM) memory or cache (SRAM) memory.

Each chiplet can be fabricated as separate semiconductor die and coupledwith the substrate 1180 via an interconnect structure 1173. Theinterconnect structure 1173 may be configured to route electricalsignals between the various chiplets and logic within the substrate1180. The interconnect structure 1173 can include interconnects such as,but not limited to bumps or pillars. In some embodiments, theinterconnect structure 1173 may be configured to route electricalsignals such as, for example, input/output (I/O) signals and/or power orground signals associated with the operation of the logic, I/O andmemory chiplets.

In some embodiments, the substrate 1180 is an epoxy-based laminatesubstrate. The substrate 1180 may include other suitable types ofsubstrates in other embodiments. The package assembly 1190 can beconnected to other electrical devices via a package interconnect 1183.The package interconnect 1183 may be coupled to a surface of thesubstrate 1180 to route electrical signals to other electrical devices,such as a motherboard, other chipset, or multi-chip module.

In some embodiments, a logic or I/O chiplet 1174 and a memory chiplet1175 can be electrically coupled via a bridge 1187 that is configured toroute electrical signals between the logic or I/O chiplet 1174 and amemory chiplet 1175. The bridge 1187 may be a dense interconnectstructure that provides a route for electrical signals. The bridge 1187may include a bridge substrate composed of glass or a suitablesemiconductor material. Electrical routing features can be formed on thebridge substrate to provide a chip-to-chip connection between the logicor I/O chiplet 1174 and a memory chiplet 1175. The bridge 1187 may alsobe referred to as a silicon bridge or an interconnect bridge. Forexample, the bridge 1187, in some embodiments, is an Embedded Multi-dieInterconnect Bridge (EMIB). In some embodiments, the bridge 1187 maysimply be a direct connection from one chiplet to another chiplet.

The substrate 1180 can include hardware components for I/O 1191, cachememory 1192, and other hardware logic 1193. A fabric 1185 can beembedded in the substrate 1180 to enable communication between thevarious logic chiplets and the logic 1191, 1193 within the substrate1180. In one embodiment, the I/O 1191, fabric 1185, cache, bridge, andother hardware logic 1193 can be integrated into a base die that islayered on top of the substrate 1180.

In various embodiments a package assembly 1190 can include fewer orgreater number of components and chiplets that are interconnected by afabric 1185 or one or more bridges 1187. The chiplets within the packageassembly 1190 may be arranged in a 3D or 2.5D arrangement. In general,bridge structures 1187 may be used to facilitate a point to pointinterconnect between, for example, logic or I/O chiplets and memorychiplets. The fabric 1185 can be used to interconnect the various logicand/or I/O chiplets (e.g., chiplets 1172, 1174, 1191, 1193). with otherlogic and/or I/O chiplets. In one embodiment, the cache memory 1192within the substrate can act as a global cache for the package assembly1190, part of a distributed global cache, or as a dedicated cache forthe fabric 1185.

FIG. 11D illustrates a package assembly 1194 including interchangeablechiplets 1195, according to an embodiment. The interchangeable chiplets1195 can be assembled into standardized slots on one or more basechiplets 1196, 1198. The base chiplets 1196, 1198 can be coupled via abridge interconnect 1197, which can be similar to the other bridgeinterconnects described herein and may be, for example, an EMIB. Memorychiplets can also be connected to logic or I/O chiplets via a bridgeinterconnect. I/O and logic chiplets can communicate via an interconnectfabric. The base chiplets can each support one or more slots in astandardized format for one of logic or I/O or memory/cache.

In one embodiment, SRAM and power delivery circuits can be fabricatedinto one or more of the base chiplets 1196, 1198, which can befabricated using a different process technology relative to theinterchangeable chiplets 1195 that are stacked on top of the basechiplets. For example, the base chiplets 1196, 1198 can be fabricatedusing a larger process technology, while the interchangeable chipletscan be manufactured using a smaller process technology. One or more ofthe interchangeable chiplets 1195 may be memory (e.g., DRAM) chiplets.Different memory densities can be selected for the package assembly 1194based on the power, and/or performance targeted for the product thatuses the package assembly 1194. Additionally, logic chiplets with adifferent number of type of functional units can be selected at time ofassembly based on the power, and/or performance targeted for theproduct. Additionally, chiplets containing IP logic cores of differingtypes can be inserted into the interchangeable chiplet slots, enablinghybrid processor designs that can mix and match different technology IPblocks.

Exemplary System on a Chip Integrated Circuit

FIGS. 12 and 13A-13B illustrate exemplary integrated circuits andassociated graphics processors that may be fabricated using one or moreIP cores, according to various embodiments described herein. In additionto what is illustrated, other logic and circuits may be included,including additional graphics processors/cores, peripheral interfacecontrollers, or general-purpose processor cores.

FIG. 12 is a block diagram illustrating an exemplary system on a chipintegrated circuit 1200 that may be fabricated using one or more IPcores, according to an embodiment. Exemplary integrated circuit 1200includes one or more application processor(s) 1205 (e.g., CPUs), atleast one graphics processor 1210, and may additionally include an imageprocessor 1215 and/or a video processor 1220, any of which may be amodular IP core from the same or multiple different design facilities.Integrated circuit 1200 includes peripheral or bus logic including a USBcontroller 1225, UART controller 1230, an SPI/SDIO controller 1235, andan I2S/I2C controller 1240. Additionally, the integrated circuit caninclude a display device 1245 coupled to one or more of ahigh-definition multimedia interface (HDMI) controller 1250 and a mobileindustry processor interface (MIPI) display interface 1255. Storage maybe provided by a flash memory subsystem 1260 including flash memory anda flash memory controller. Memory interface may be provided via a memorycontroller 1265 for access to SDRAM or SRAM memory devices. Someintegrated circuits additionally include an embedded security engine1270.

FIGS. 13A-13B are block diagrams illustrating exemplary graphicsprocessors for use within an SoC, according to embodiments describedherein. FIG. 13A illustrates an exemplary graphics processor 1310 of asystem on a chip integrated circuit that may be fabricated using one ormore IP cores, according to an embodiment. FIG. 13B illustrates anadditional exemplary graphics processor 1340 of a system on a chipintegrated circuit that may be fabricated using one or more IP cores,according to an embodiment. Graphics processor 1310 of FIG. 13A is anexample of a low power graphics processor core. Graphics processor 1340of FIG. 13B is an example of a higher performance graphics processorcore. Each of the graphics processors 1310, 1340 can be variants of thegraphics processor 1210 of FIG. 12 .

As shown in FIG. 13A, graphics processor 1310 includes a vertexprocessor 1305 and one or more fragment processor(s) 1315A-1315N (e.g.,1315A, 1315B, 1315C, 1315D, through 1315N-1, and 1315N). Graphicsprocessor 1310 can execute different shader programs via separate logic,such that the vertex processor 1305 is optimized to execute operationsfor vertex shader programs, while the one or more fragment processor(s)1315A-1315N execute fragment (e.g., pixel) shading operations forfragment or pixel shader programs. The vertex processor 1305 performsthe vertex processing stage of the 3D graphics pipeline and generatesprimitives and vertex data. The fragment processor(s) 1315A-1315N usethe primitive and vertex data generated by the vertex processor 1305 toproduce a framebuffer that is displayed on a display device. In oneembodiment, the fragment processor(s) 1315A-1315N are optimized toexecute fragment shader programs as provided for in the OpenGL API,which may be used to perform similar operations as a pixel shaderprogram as provided for in the Direct 3D API.

Graphics processor 1310 additionally includes one or more memorymanagement units (MMUs) 1320A-1320B, cache(s) 1325A-1325B, and circuitinterconnect(s) 1330A-1330B. The one or more MMU(s) 1320A-1320B providefor virtual to physical address mapping for the graphics processor 1310,including for the vertex processor 1305 and/or fragment processor(s)1315A-1315N, which may reference vertex or image/texture data stored inmemory, in addition to vertex or image/texture data stored in the one ormore cache(s) 1325A-1325B. In one embodiment the one or more MMU(s)1320A-1320B may be synchronized with other MMUs within the system,including one or more MMUs associated with the one or more applicationprocessor(s) 1205, image processor 1215, and/or video processor 1220 ofFIG. 12 , such that each processor 1205-1220 can participate in a sharedor unified virtual memory system. The one or more circuitinterconnect(s) 1330A-1330B enable graphics processor 1310 to interfacewith other IP cores within the SoC, either via an internal bus of theSoC or via a direct connection, according to embodiments.

As shown FIG. 13B, graphics processor 1340 includes the one or moreMMU(s) 1320A-1320B, cache(s) 1325A-1325B, and circuit interconnect(s)1330A-1330B of the graphics processor 1310 of FIG. 13A. Graphicsprocessor 1340 includes one or more shader core(s) 1355A-1355N (e.g.,1455A, 1355B, 1355C, 1355D, 1355E, 1355F, through 1355N-1, and 1355N),which provides for a unified shader core architecture in which a singlecore or type or core can execute all types of programmable shader code,including shader program code to implement vertex shaders, fragmentshaders, and/or compute shaders. The exact number of shader corespresent can vary among embodiments and implementations. Additionally,graphics processor 1340 includes an inter-core task manager 1345, whichacts as a thread dispatcher to dispatch execution threads to one or moreshader cores 1355A-1355N and a tiling unit 1358 to accelerate tilingoperations for tile-based rendering, in which rendering operations for ascene are subdivided in image space, for example to exploit localspatial coherence within a scene or to optimize use of internal caches.

Configurable Re-Order Buffer

In some systems, memory reads are performed on a 64B (64 byte) basis butinputs to a decompressor are 128B or 256B. Depending on the compressedstate, the decompressor may process 1, 2, 3, or 4 64B cache lines ofdata. As reads from memory are not always returned in order, read dataare stored in the reorder buffer (ROB) prior to being dispatchedin-order to the decompressor. A ROB is used for media decompression asmultiple cache lines may be required as an input to the decompressor.Various embodiments provide a system that tracks receipt of data into abuffer and receipt of a last data portion associated with a read requestto ensure that data are provided to the decompressor in-order. Accordingto various embodiments, an amount of memory space allocated to memoryused by the ROB can be configured to reduce an amount of memory spaceallocated to reorder data and allow memory use for other purposes.

An application, driver, or operating system (OS) can issue a draw callto generate image data. For example, a media pipeline run by a GPUproduces close captioning (text), web camera window, video playback(e.g., MPEG, JPEG) in a 3D-scene, or content with a pattern or gradient.For example, bi-model compression can be applied to red green blue (RGB)pixel values or video data Image data can be compressed to reduce a sizeof image data and stored in memory. Compressed image data can beretrieved for further processing by a pipeline or for display. A renderpipeline consumes data compressed by a media pipeline. A render pipelinegenerates composite image from graphics and images or video for outputto display at frame rate or apply upscaling to the display format. Forexample, a driver executed by a processor can enable use of compressionor access to compressed data.

FIG. 14 depicts a block diagram of a memory and reorder buffer (ROB)system. ROB system 1400 receives compressed data from memory 1450,stores the data, and provides data in-order to decompressor 1420. Insome examples, in response to a read request, compressed data are sentfrom memory 1450 in multiple segments or entries and the compressed dataare stored in data buffer 1410 prior to being sent or copied in-order todecompressor 1420.

For example, a lossy or lossless decompression unit (e.g., decompressor1420) can launch read requests to memory 1450. A read request can causea read of one or more entries from memory 1450 for storage to databuffer 1410. Data buffer 1410 can be implemented using a dynamic randomaccess memory (DRAM) or other RAM. Data can be received from memory 1450in a compressed format. Compressed data segments or entries from memory1450 can be received at data buffer 1410 out-of-order but decompressor1420 decodes data in-order. For example, if a data request is for 256bytes of data that are compressed to 128 bytes but merely 64 bytes aretransferred or copied using a memory interface to data buffer 1410 in aclock cycle, then two 64 byte segments are transferred to data buffer1410 over two clock cycles. ROB system 1400 ensures that allocationorder is maintained such that ROB system 1400 copies data todecompressor 1420 in the order of allocation so that decompressor 1420can decode data in order. Data read from memory 1450 may need to bereordered because data is provided from memory 1450 out-of-order (evenif data is read from the same page).

If a 64 byte segment corresponding to a first allocation is receivedafter a 64 byte segment corresponding to a second allocation, ROB system1400 waits until receiving the 64 byte segment corresponding to thefirst allocation before providing the 64 byte segments corresponding tothe first and second allocations to decompressor 1420. However, after a64 byte segment corresponding to a first allocation is received, the 64byte segment corresponding to the first allocation is provided todecompressor after received in ROB system 1400.

In some examples, if a memory bus interface between memory 1450 and ROBsystem 1400 supports transfer of 64 bytes in a clock cycle, then datacompressed to 64 bytes or less can be transferred in a single clockcycle to decompressor 1420 and does not need to be stored in data buffer1410. FIG. 14 depicts such transfer as a “Bypass” from memory 1450 todecompressor 1420 using an interface such as an interconnect.

Read controller 1402 manages allocation of entries in ROB system 1400. Aread request can cause reading of one or more entries from memory 1450depending on memory bus size and compression state. Read requests tomemory 1450 from a client (e.g., a decompressor or render pipeline thatuses a decompressor) can be provided to read controller 1402. Readcontroller 1402 receives a read request and looks up a compression statefrom data compression state cache 1412 (e.g., a memory or cache region)that associates data to be read (from the read request) with acompression amount. For a read request, read controller 1402 determinesa number of entries to allocate based on an amount of data to retrieveand a compression state or level of the data. For a read request, readcontroller 1402 pre-allocates tracking FIFO 1404, control information1406, data-present indicator 1408, and data buffer 1410 based on a sizeof data to be read from memory 1450 and a compression state or level ofthe data.

For example, read controller 1402 initializes all of the allocatedentries to reset in data-present indicator 1408 to indicate that none ofthe entries associated with the read request are stored in data buffer1410. Control information 1406 includes compression information for oneor more entries that are to be stored in data buffer 1410. Compressioninformation can include compression state (e.g., 256B to 96B, 256B to64B, and so forth), surface format (16 bits-per-pixel, 32bits-per-pixel, 64 bits-per-pixel, and so forth), compression format(e.g., bitmaps, graphics interchange format (GIF), joint photographicexperts group (JPEG), Quicktime, portable network graphic (PNG)), andother metadata. Compression information can be provided to decompressor1420 for use to decompress data from data buffer 1410. Compressioninformation can be received from a client, from compression state cache1412, and other memory reads performed by read controller 1402.

A read request for data sent to memory 1450 is tagged or associated withone or more entries. The number of entries allocated can correspond to anumber of compressed cache lines that are fetched from memory 1450. Acache line can be any size such as 32B, 64B, or any multiple of 32B.

Data-present indicator 1408 stores per entry information of whether datafor the entry is present or not in data buffer 1410. Data-presentindicator 1408 is initialized to reset for all entries. When an entry isstored in data buffer 1410, the associated per-entry reset/set indicatoris changed to set. When a data entry is received at data buffer 1410,the indicator in data-present indicator 1408 for the entry is changed toset. When data-present indicator 1408 for a head of line entry is in aset state and the head of line entry is also identified by theread-pointer of tracking FIFO 1404, associated content of controlinformation 1406 and data buffer 1410 are read and the transaction issent to decompressor 1420. For example, the head of line data andassociated compression information are sent to decompressor 1420.

Tracking first-in-first-out (FIFO) controller 1404 causes data entriesfrom data buffer 1410 to be copied or sent from data buffer 1410 todecompressor 1420 in order of allocation. Tracking FIFO controller 1404can use write and read pointers to track data stored in data buffer 1410and cause data to be output to decompressor 1420 in order of entryallocation. In addition, tracking FIFO controller 1404 can identifywhether any entry is a last received entry. A last received entryindicator for all entries can be initialized to false.

Tracking FIFO controller 1404 can use a last received entry indicator toidentify when a last allocated entry in a read request is received. Oneor more bits can be used by tracking FIFO controller 1404 to indicate anentry from the last cache line is received corresponding to the dataundergoing decompression. The last allocated entry or last cache linereceived indicator can indicate that the last entry in an in-ordersequence of entries is stored in data buffer 1410 or that all entriesassociated with a read request have been stored in data buffer 1410.

Data can be copied from data buffer 1410 to decompressor 1420 (or madeavailable for access by decompressor 1420 by providing a pointer) basedon a value of a read-pointer of tracking FIFO 1404. The read-pointerproceeds sequentially from first allocated entry (head of line) to lastallocated entry (e.g., entry0 to entryN) in data buffer 1410 even thoughdata is stored or received out of order in data buffer 1410. A head ofline entry can refer to an entry that has not been provided fordecompression and is to be provided before another entry when entriesare to be provided in-order to decompressor 1420. Decompressor 1420 canreceive control information and entries from data buffer using aninterface such as a bus or other interconnect. Decompressor 1420 can usebuffer 1414 to store one or more entries. Buffer 1414 can be 256B insize (or other sizes) and be implemented as part of a memory or cache.Decompressor 1420 can start decompression when all entry data isavailable in-order or when decompressor 1420 receives a head of linedata entry in a sequence of one or more data entries. Decompressor 1420can use a cache (e.g., level-1, level-2, level-3, or last level cache)(not depicted) to store data from data buffer 1410. Decompressor 1420can perform any type of lossy or lossless decompression scheme includingdecompression of any of graphics interchange format (GIF), jointphotographic experts group (JPEG), Quicktime, or portable networkgraphic (PNG).

FIG. 15A depicts an example of contents of tracking FIFO, controlinformation, data-present indicators, and data buffer allocated forvarious read requests. For any read request, WritePointer is used toindicate which entry slot in data buffer is written-to and a ReadPointeris used to indicate which entry slot in data buffer is head of line andto be read-from.

For example, for a Read_requestO can trigger allocation of multipleentries 0 to N, wherein N≥2, for a read request. Tracking FIFO'sIsLastEntry0 to IsLastEntryN are allocated for respective entries 0 toN. Control information can include characteristics of one or more ofentries of the compressed data (e.g., compression type, data format, andother meta data). Data-present can indicate whether any entry 0 to N isstored in the data buffer by indication of a set. Reorder buffer can beused to provide entries 0 to N in-order to a decompressor even ifreceived out-of-order in a data buffer. Tracking FIFO can identify whena last entry is received (LastEntryRecd) whether the entry was receivedin or out-of-order.

In this example, Read_request1 has merely one entry associated with aread request. Tracking FIFO's IsLastEntry0 is allocated for the oneentry, Entry0. In addition, control information and data-present canrefer to a single entry. A single entry is allocated in data buffer.Note that in some examples, if merely one entry is to be allocated andthe size of the data of the entry can be sent to the decompressor in oneclock cycle, then the reorder buffer is bypassed and data is provideddirectly to the decompressor.

In this example, Read_requestM has two entries associated with a readrequest. Tracking FIFO's IsLastEntry0 and IsLastEntry1 are allocated forrespective entries 0 and 1. In addition, control information anddata-present are allocated for both entries. Two entries are allocatedin data buffer.

FIG. 15B-1 to 15B-3 depicts an example of use of a tracking FIFO anddata-present indicators to provide entries in-order to a decompressor.More specifically, FIG. 15B-1 depicts an example of allocating entriesin Tracking FIFO, control information, data-present, and data buffer forthree entries. In this example, a read request causes entries 0 to 2 tobe allocated. At 1502, WritePointer is set to Entry1 and ReadPointer isset to Entry0. Tracking FIFO is allocated to indicateIsLastEntry0=FALSE, meaning Entry0 is not a last entry. Controlinformation includes compression information of Entry0 (shown asCharacteristics0). Data-present indicates that Entry0 is not present byindicating a state of Reset0. The data buffer is empty as no data hasbeen received.

At 1504, WritePointer is set to Entry2 and ReadPointer remains set toEntry0. Tracking FIFO is allocated to add IsLastEntry1=FALSE, meaningEntry1 is not a last entry. Control information is updated to includecompression information of Entry1 (shown as Characteristics1).Data-present is updated to indicate that Entry1 is not present byindicating a state of Reset1. The data buffer is empty as no data hasbeen received.

At 1506, WritePointer is set to Entry3 and ReadPointer remains set toEntry0. Tracking FIFO is allocated to add IsLastEntry2=TRUE, meaningEntry2 is a last entry for a read request. Control information isupdated to include compression information of Entry2 (shown asCharacteristics2). Data-present is updated to indicate that Entry2 isnot present by indicating a state of Reset2. The data buffer is empty asno data has been received.

FIG. 15B-2 depicts an example of out-of-order data receipt. ReadPointeris set to Entry0, which is the head of the line entry. WritePointer isset to Entry3 for writing of entries of another read request. At 1510,Entry1 is received and stored in the data buffer. In Data-present,Reset0 is changed to Sett to indicate Entry1 is present in data buffer.At 1512, Entry2 is received and stored in the data buffer. InData-present, Reset2 is changed to Set2 to indicate Entry2 is present indata buffer. At 1514, Entry0 is received and stored in the data buffer.In Data-present, Reset0 is changed to Set0 to indicate Entry0 is presentin data buffer. As IsLastEntry2=TRUE and Data-present includes Set0 toSet2 to indicate all entries are present in data buffer, dispatch of theentries to the decompressor can proceed.

Note that had Entry0 been received prior to 1512, Entries0 and 1 couldbe provided to the decompressor and Read pointer would be advanced fromEntry0, to Entry1, and to Entry2.

FIG. 15B-3 depicts an example in-order entry dispatch. At 1520,ReadPointer allows Entry0 to be dispatched to the decompressor andReadPointer advances to Entry 1. IsLastEntry0 in Tracking FIFO, Set0 indata-present, Characteristics0 in Control information, and Entry0 indata buffer are deallocated (as indicated by striped lines).

At 1522, ReadPointer allows Entry1 to be dispatched to the decompressorand ReadPointer advances to Entry 2. IsLastEntry1 in Tracking FIFO, Set1in data-present, Characteristics1 in Control information, and Entry1 indata buffer are deallocated (as indicated by striped lines).

At 1524, ReadPointer allows Entry2 to be dispatched to the decompressorand ReadPointer advances to Entry 3. IsLastEntry2 in Tracking FIFO, Set2in data-present, Characteristics2 in Control information, and Entry2 indata buffer are deallocated (as indicated by striped lines).Deallocation of entries can allow the entries to be used by another readrequest or the underlying memory resources to be used for other uses.

Various embodiments provide a manner of determining an amount of memoryto allocate to a data buffer in connection with reordering entriesassociated with a data read. For example, a determination can be made ofdata compression that yields compressed data that is larger than anamount of data that a memory bus can transfer in a clock cycle. Apercentage of clock cycles in which data of such data compression levelis applied can be determined and used to determine an amount of memoryto reserve for use in reordering data.

For example, if a memory bus can transfer 64 bytes in a single clockcycle, a determination is made as to a percent of time more than 64bytes were transferred in a time window. For example, a determination ismade that for 25% of the clock cycles, data is compressed from 256B (orother size) to 96B or higher. For example, for 128 clock cycles used tofetch data, where 50% of data is compressed and 12.5% of the compresseddata is compressed from 256B to 96B or higher, 16 clock cycles latencycan be observed from reorder buffering. Sizing a data buffer to store atleast 16 entries can potentially hide or reduce latency from memoryfetch to availability at the decompressor from use of a ROB as there isenough memory allocation in the memory buffer to store all entries forwhich latency may be attributed.

Various embodiments adjust an amount of memory allocated to the databuffer used in a re-ordering based on mode of operation such as one ormore of workload type and applied compression. An amount of memoryallocated to the data buffer for re-ordering can be changed per readrequest or for a group of read requests. At least one iteration isobserved to learn a profile for different workloads. For example, ahardware profile benchmark (e.g., Manhattan, Car Chase) can be used. Thefollowing provides non-limiting examples of data buffer sizing forvarious workload (application) types.

Application Profile Game1 For 128 clock cycles where 100% of datatransfers are compressed data, 25% of compressed data is 256 B -> 96 Bor more. Accordingly, at least 128*.25 = 32 entries can be allocated ina data buffer for re-ordering. Game2 For 128 clock cycles where 100% ofdata transfers are compressed data, 30% of compressed data is 256 B ->96 B or more. Accordingly, at least 128*.30 = 39 entries can beallocated in a data buffer for re-ordering. If a latency for display offormerly compressed data for a game is too high, this profile can beused. Game3 For 128 clock cycles where 100% of data transfers arecompressed data, 35% of compressed data is 256 B -> 96 B or more.Accordingly, at least 128*.35 = 45 entries can be allocated in a databuffer for re-ordering. If a latency for display of formerly compresseddata for a game is too high, this profile can be used. Powerpoint ® For128 clock cycles where 100% of data transfers are compressed data, 20%of compressed data is 256 B -> 96 B or more. Accordingly, at least128*.2 = 26 entries can be allocated in a data buffer for re-ordering.Streaming video (e.g., For 128 clock cycles where 100% of data transfersare compressed Netflix ®, YouTube ®, data, 50% of compressed data is 256B -> 96 B or more. Hulu ®) Accordingly, at least 128*.5 = 64 entries canbe allocated in a data buffer for re-ordering. Streaming video2 For 128clock cycles where 100% of data transfers are compressed data, 60% ofcompressed data is 256 B -> 96 B or more. Accordingly, at least 128*.6 =77 entries can be allocated in data buffer for re-ordering. If a latencyfor display of formerly compressed data for a game is too high, thisprofile can be used. Desktop composition For 128 clock cycles where 100%of data transfers are compressed (Windows ®, Linux ®, data, 70% ofcompressed data is 256 B -> 96 B or more. Android ®, MacOS ®)Accordingly, at least 128*.7 = 90 entries can be allocated in databuffer for re-ordering.

FIG. 16A depicts a process that can be used to track receipt of entriesassociated with a read request from memory and buffering of data priorto providing the data, in-order, for access by a decompressor or otherdevice or software. At 1602, one or more entries associated with a readrequest are allocated in a reorder buffer. The reorder buffer can trackreceipt and characteristics of the one or more entries in a buffer. Forexample, tracking entries associated with the read request received inthe buffer can take place. Entries can correspond to compressedportion(s) of data requested to be read and the entries are stored inthe buffer prior to transfer or access by a decompressor.Characteristics of received entries can include information such as, butnot limited to, compression state (e.g., 256B to 96B, 256B to 64B, andso forth), surface format (16 bits-per-pixel, 32 bits-per-pixel, 64bits-per-pixel, and so forth), compression format (e.g., bitmaps,graphics interchange format (GIF), joint photographic experts group(JPEG), Quicktime, portable network graphic (PNG)), and other metadata.Characteristics can be stored for every entry or just for a read requestregardless of number of entries. Characteristics can be loaded from alook-up-table that identifies compression information of data stored inmemory.

At 1604, a determination is made as to whether an entry is received in adata buffer. If an entry is received, at 1606, a tracker for the entryis updated to indicate the entry has been received. In addition, if areceived entry is a first entry in a group of one or more entries, anentry that follows in-order behind another entry already provided to thedecompressor, or a sole entry associated with a read request, the entryis available for processing by a decompressor. If a new entry is notreceived, 1604 repeats to detect receipt of an entry in a data buffer.

At 1608, a determination is made as to whether a last entry associatedwith a read request is received. For example, if a last entry isidentified as received, then at 1610, the last entry received indicatoris set to positive and all entries, not previously provided to thedecompressor, are permitted to be provided in-order for processing bythe decompressor. If not all entries are received, the process returnsto 1604.

FIG. 16B depicts a process that can be used to allocate an amount ofmemory space allocated for use to reorder entries prior to making dataavailable for processing by a decompressor. At 1650, an initial resourcereservation of memory for use in reordering data can be set based onstart-up parameters. For example, a decompressor, render pipeline, orother memory client can be allocated a particular amount of memoryresources based on priority level and unused memory resources. At 1652,a determination is made as to whether reserved memory resources are tobe changed. For example, a determination can be made whether a modeoperation has changed. A mode of operation can include change of anactive application and/or change of an amount of compressed datarequested for decompression. For example, a type of application can be agame, spreadsheet, streaming video, word processor, desktop compositionand so forth. If a type of application that requests decompression ofdata changes or an amount of compressed data that is requested fordecompression increases over a time period, then the process can proceedto 1654. If the reserved memory resources are not to be changed, theprocess returns to 1652.

At 1654, the process sets an amount of memory resources to reserve forre-order buffering. An amount of memory resources to reserve forre-order buffering can be based on one or more of: type of applicationthat is active and requesting generation of images or an amount ofmemory used in re-ordering buffering (e.g., based on an amount ofcompressed data to be re-ordered prior to being provided to thedecompressor). An amount of memory resources to reserve can be set basedon the newly active type of application that is requesting generation ofimages, a recent trend to a different amount of compressed data to bere-ordered prior to being provided to the decompressor, for example. Alook-up table can be used to associate a memory resource reservationwith a type of application. As described earlier, computations can beused to indicate an amount of entries to allocate in a memory resourcefor re-order buffering based on compression levels and amount ofcompressed data transmitted over a duration of clock cycles.

Legacy commercial solutions use static allocation of ROB slots tomultiple memory clients (MCs). A few techniques of dynamic allocation ofROB entries have been proposed, but they are primarily for allocation ofROB entries between multiple threads in a Simultaneous Multi-threaded(SMT) out-of-order (OOO) processor with out-of-order issues and in-ordercommit of instructions in a thread. Some of them use multiple headpointers and tail pointers (one per requesting client/thread) fordynamic allocation of ROB entries. One of the techniques divides theallocation of ROB entries to pairs of threads, where each pair ofthreads can share its allocated set of ROB entries.

In case of static ROB allocation solutions, each memory client can onlyuse n/m ROB entries, where n is the total number of ROB entriesavailable in the system and m is the number of memory clients, or afixed allocation determined at the processor design stage beforeproductizing the processor. For examples of static allocation of ROBentries, see: “Design of an 8-wide Superscalar RISC Microprocessor withSimultaneous Multithreading,” Ronald P. Preston et al. ISSCC2002/SESSION 20/MICROPROCESSORS; “Hyper-Threading TechnologyArchitecture and Microarchitecture,” Deborah T. Marr et al. IntelTechnology Journal Q1, 2002; and “The Impact of Resource Partitioning onSMT Processors,” Steven E. Raasch and Steven K. Reinhardt—12thInternational Conference on Parallel Architectures and CompilationTechniques (PACT), 2003; and “Improving Memory Latency Aware FetchPolicies for SMT Processors,” Francisco J. Cazorla et al. ISHPC 2003,LNCS 2858, pp. 70-85, 2003.

Dynamic ROB allocation/partitioning solutions can be applied in otherprocessing scenarios such as sharing of multiple resources betweenthreads in a SMT OOO microprocessor, but cannot be easily adapted toallocation of ROB entries to multiple memory clients where the ROB isused for ordering of memory read accesses to each memory client. Most ofthese dynamic techniques have limited dynamism (or sharing) in theirallocation policies, which can still leave room for performancebottlenecks and in some cases, can create more performance bottlenecksthan static allocation schemes. For examples of dynamic allocation ofROB entries, see: “The Impact of Resource Partitioning on SMTProcessors,” Steven E. Raasch and Steven K. Reinhardt—12th InternationalConference on Parallel Architectures and Compilation Techniques (PACT),2003; “Adaptive Reorder Buffers for SMT Processors,” Joseph Sharkey etal. PACT'06, Sep. 16-20, 2006; “Paired ROBs: A Cost-Effective ReorderBuffer Sharing Strategy for SMT Processors”, R. Ubal et al, Euro-ParParallel Processing, pp. 309-320, 2009; “Utilization-Based ResourcePartitioning for Power-Performance Efficiency in SMT Processors,”Huaping Wang et al. TPDS 2011; “An Adaptive Resource PartitioningAlgorithm for SMT Processors,” Huaping Wang et al. PACT'08, October25-29, 2008; “Exploiting Choice: Instruction Fetch and Issue on anImplementable Simultaneous Multithreading Processor,” Dean M. Tullsen etal. ISCA '96 23rd Annual International Symposium on ComputerArchitecture, Philadelphia, Pa., May, 1996; “Dynamically ControlledResource Allocation in SMT Processors,” Francisco J. Cazorla et al. 37thInternational Symposium on Microarchitecture (MICRO37 2004);“Transparent Threads: Resource Sharing in SMT Processors for High SingleThread Performance,” Gautham K. Dorai and Donald Yeung—2002International Conference on Parallel Architectures and CompilationTechniques (PACT'02); and “Learning-Based SMT Processor ResourceDistribution via Hill-Climbing,” Seungryul Choi, Donald Yeung—2006International Symposium on Computer Architecture (ISCA-XXXIII), Boston,Mass.

For example, in a head pointer and tail pointer based dynamic allocationapproach, if the tail pointer of first thread's ROB allocation entriesmoves adjacent to the head pointer of second thread's ROB allocationentries and if the first thread gets more ROB allocation requests, thenthe first thread's ROB allocation has to stall, even though there may bemany empty ROB entries after second thread's tail pointer. In case offixed allocation to a pair of threads where the pair of threads canshare their allocation of ROB entries, if the first pair's ROBallocation is exhausted while second pair's ROB allocation has manyempty ROB entries and if first pair makes more ROB allocation requests,then the first pair's ROB allocation has to stall even though there areempty ROB entries in second pair's ROB allocation.

In order to improve performance for at least some of these clients andto avoid performance bottlenecks in the memory access path, effectiveutilization of available ROB entries to multiple memory clients isneeded. Effective utilization can be achieved by optimal allocation ofROB entries to multiple clients, based on each client's memory accessrequirements. Apart from ordering the memory read returns, an allocationlogic can prioritize the requests between multiple clients. Theallocation of ROB entries can be static (fixed number of ROB entries perclient) or dynamic (number of entries per client can be increased ordecreased based on the client memory read requirements and read returntraffic pattern) in nature.

Various embodiments provide a dynamic ROB allocation technique to ensurebetter performance for the memory clients and to avoid memory accesspath performance bottlenecks to certain extent. Various embodimentsprovide a dynamic ROB allocation scheme that can avoid underutilizationexperienced by static allocation policies. Various embodiments canpotentially ensure better utilization of ROB entries compared toacademic dynamic ROB allocation solutions, to attempt to reduceperformance bottlenecks. Various embodiments can potentially achieveless performance bottlenecks compared to static allocation solutions andacademic dynamic ROB allocation solutions, at least because variousembodiments allow stalling of memory clients to occur if the entire setof ROB entries are allocated (or borrowed) whereas current staticallocation solutions stall memory clients if any of the memory client'sstatic ROB allocation is exhausted and dynamic allocation solutions maystall memory clients before the entire set of ROB entries are exhausted.

Various embodiments can be applied to multiple memory clients requestingmemory access from memory or cache in an ordered fashion in amicroprocessor or GPU, whereas most of the existing solutions areapplicable to multiple threads requesting for shared ROB entries in anSMT OOO microprocessor. A memory client can make memory access requestsof compressed or uncompressed data. An example of a memory client can bea decompressor, rendering pipeline, a graphics processing unit, acentral processing unit, a fixed function accelerator, a programmablelogic device, and so forth.

FIG. 17 shows multiple memory clients (e.g., clients 1 to 4) makingmemory access requests and being allocated with ROB entries from the ROBallocation entries parked for each memory client's usage. Multiplememory clients can make memory read requests through shared cache tomemory (e.g., DRAM). Initially, an arbitrator (not shown) decides whichmemory client's memory read request to accept during a current clockcycle. Before making the request to cache/memory, this memory client's(MC_(i)) memory read request is allocated with a ROB entry from the ROBentries (m_(i)) available for MC_(i)'s usage. These entries areallocated in order. Read requests to cache/memory can be serviced bycache/memory or the memory access path in out-of-order manner. When theread request returns with data from cache/memory, a check is made in thespecific memory client's ROB entry to see whether it is at the top ofthe order for return to the memory client MC_(i). If it is not at thetop of the order, it waits until all the responses (read data) for ROBentries for the MC_(i), which are above in the order compared to thisROB entry are returned to MC_(i).

For example, if there are 4 memory clients and 64 ROB entries, aprocessor implementation may have a static ROB allocation where 24 ROBentries are allocated for client 1, 12 ROB entries allocated for client2, 16 ROB entries allocated for client 3 and 12 ROB entries allocatedfor client 4. Even if some of the memory clients are not making memoryaccess requests during a specific time duration, some of the rest of thememory clients, which may need more ROB entries than their fixedallocation (n/m or fixed allocation at processor design stage), cannotbe allocated more ROB entries than their fixed allocation and may stall.Hence the ROB may be underutilized during such durations and thedeserving memory clients, which may require larger ROB allocation thanits fixed limit, may get stalled.

Various embodiments provide dynamic allocation of ROB entries tomultiple memory clients. Initially, a memory client MC_(i) is allocatedROB entries for its usage (Σ_(i=1) ^(k) m_(i)=n, where n=total number ofROB entries and k=total number of memory clients). The value of may bedetermined based on the priority of each MC_(i) as determined by runningsimulations across multiple workloads using a timing accurate softwareperformance simulator for the processor or GPU and identifying optimalm_(i) for each MC_(i) for overall best average performance acrossworkloads.

As MC_(i) starts making memory access requests, ROB entries from areallocated one at a time. When all of are exhausted (or if it is close toexhausting m_(i), which can be indicated by a threshold m_(i)-T4_(i)where T4_(i) is defined later) and if there are more memory accessrequests from MC_(i) while waiting for deallocations from its allocatedm_(i) entries, then MC_(i) can borrow e entries from m_(j) ROB entriesparked for usage of MC_(i), if MC_(j) has T3_(j)+T4_(j) entries (definedlater) not allocated yet or has already been deallocated, and has theleast growth rate (defined later).

After the entries of MC_(j) are exhausted, MC_(j) can borrow from m_(k)entries of MC_(k), and so on, to create a chain-like borrowing scheme.Note that MC_(i) can borrow from multiple other MCs as required. Oncethe last memory client in the chain (MC_(last)) exhausts its m_(l)entries and if it makes further memory access requests, it can requestthe least growth rate memory client to return e entries (an example ofROB growth rate is defined below). If the least growth rate memoryclient MC_(lgr) does not have T3_(lgr)+T4_(lgr) entries free (notallocated yet or deallocated), it should stop accepting further memoryread requests (stalling MC_(lgr)) and wait for deallocation of e entriesand then return the e entries to MC_(last).

Example terminology for different ROB allocation thresholds aredescribed next. Thresholds T1, T2, T3, and T4 represent multiplethresholds in allocation of ROB entries for a memory client. T1, T2, T3,T4 may be different for different memory clients. So Tx_(i) and Tx_(j)are not necessarily equal (where x=1, 2, 3, or 4). Different thresholdssuch as T1_(i), T2_(i), T3_(i), T4_(i), AT_(min_i), AT_(wm_i), andAT_(max_i) are defined below.

T1_(i)=AT_(min_i)=minimum allocation threshold of any memory clientMC_(i) whereby other clients cannot borrow from T1_(i) entries reservedfor MC_(i).

T1_(j)+T2_(j)=AT_(wm_i)=allocation threshold of memory client MC_(j)beyond which any memory client MC_(i) cannot request MC_(j) forborrowing its ROB entries. For MC_(j) to be a lender, it is to haveminimum T3_(j)+T4_(j) entries free (not allocated yet or has beenalready deallocated).

T1_(i)+T2_(i)+T3_(i)=AT_(max_i)=allocation threshold at which memoryclient MC_(i) requests for borrowing ROB entries from entries parked forother clients' (MC_(j)) usage. MC_(j)'s allocation should not havecrossed AT_(wm).

T1_(i)+T2_(i)+T3_(i)+T4_(i)=m_(i) for memory client MC_(i)=total ROBentries parked for memory client MC_(i)'s usage.

ROB growth rate (RGR_(i)) for a memory client MC_(i) can be a rate ofgrowth of ROB allocations for MC_(i) during a specified time interval(hereafter called an epoch, where an epoch is c clock cycles). Note thatthe ROB growth rate of MC_(i) is higher if allocation of ROB entries toMC_(i) increases at a faster rate compared to deallocation of MC_(i)'sROB entries during an epoch. ROB growth rate can be checked throughmultiple approaches, and two different example approaches are givenbelow.

A ROB allocation-deallocation difference approach can be used todeterminate a ROB growth rate. Growth rate for a memory client (MC_(i))is defined as the difference (d_(i)) of ROB entries allocated and ROBentries deallocated during an epoch. A check is made which of clientshave the highest growth rate d_(max) and lowest growth rate d_(min). Theclient whose growth rate is highest (d_(max)) and has crossed a maximumthreshold of allocated ROB entries (m_(i)-T4_(i) for MC_(i)) can borrowfrom the client with the least growth rate (d_(min)) and has enough ROBentries to lend (indicated by at least T4_(j)+T3_(j) entries notallocated yet or has been deallocated for MC_(j)). Note that multipleclients crossing its maximum threshold of allocated ROB entries canborrow from multiple other clients, but the above rules apply. The d_(i)can be averaged over h previous epochs (to introduce hysteresis) for thecurrent epoch comparison over multiple clients, so that the highestgrowth rate and lowest growth rate memory clients have highest andlowest growth rate respectively for multiple epochs and is not a spikebehavior of higher or lower growth rates.

A ROB occupancy sum approach can be used to determine a ROB growth rate.A sum (S_(i)) of the ROB occupancy of each ROB entry for the memoryclient (MC_(i)) during the epoch can take place. Occupancy of a ROBentry can be determined some number of clock cycles between allocationand deallocation if both allocation and deallocation of the ROB entryhappened in current epoch (or cycles from allocation to end of currentepoch, if deallocation has not yet happened in the current epoch.Occupancy of a ROB entry can be determined some number of cycles from astart of current epoch to deallocation, if allocation happened in aprior epoch and deallocation happened in a current epoch. Occupancy of aROB entry can be determined some number of cycles from start to end of acurrent epoch, if allocation happened in a prior epoch and deallocationhas not happened yet.

The ROB occupancy sum S_(i) for MC_(i) is divided by a number ofallocated entries (a_(i)) in an epoch to obtain the client's ROBoccupancy rate (ROR_(max)=S_(i)/a_(i)). Note that a_(i) consists of allthe ROB entries of the client that were in allocated state at least for1 clock cycle in the epoch. Here a_(i) does not include any ROB entriesthat were not at all in allocated state during the epoch.

The client whose ROR is the highest (ROR_(max)) has the highest ROBgrowth rate (RGR_(max)) and the client whose ROR is the least(ROR_(min)) has the least ROB growth rate (RGR_(min)). The client whosegrowth rate is highest (RGR_(max)) and has crossed a maximum thresholdof allocated ROB entries (m_(i)-T4_(i) for MC_(i)) can borrow from theclient with the least growth rate (RGR_(min)) and has enough ROB entriesto lend (indicated by at least T4_(j)+T3_(j) entries not allocated yetor has been deallocated for MC_(j)). The RGR_(i) can be averaged over hprevious epochs (to introduce hysteresis) for the current epochcomparison over multiple clients, so that the highest growth rate andlowest growth rate memory clients have highest and lowest growth raterespectively for multiple epochs and is not a spike behavior of higheror lower growth rates.

FIG. 18 depicts an example of a ROB, before borrowing and afterborrowing by MC₁ (client 1) from lender MC₃ is shown. MC₁, uponreceiving a new allocation request, borrows e entries from MC₃ (whichhas T3₃+T4₃ free entries before borrowing) and then services the newallocation request. A new T3 of MC₁ is given as T3_(1_new)=T3_(1_old)+e.New T3 of MC₃ is given as T3_(3_new)=T3_(3_old)−e.

FIGS. 19A-19C depict a chain-like borrowing scheme for borrowing ROBentries by multiple memory clients from ROB allocation for multiplememory clients. In this example, MC₁ borrows from MC₂, MC₂ borrows fromMC₃, and MC₃ borrows from MC₄. Once the entries of MC_(j) are exhausted(after it starts lending its free ROB entries to MC_(i) which alsoexhausted its m_(i) entries), MC_(j) can borrow from m_(k) entries ofMC_(k) and so on to create a chain borrowing scheme. Note that MC_(i)can borrow from multiple other MCs as needed. Once the last MC_(l) inthe chain exhausts its m_(l) entries and if MC_(last) makes furthermemory access requests, it can request the least growth rate memoryclient to return e entries. If the least growth rate memory clientMC_(lgr) does not have T3_(lgr)+T4_(lgr) entries free (not allocated yetor deallocated), it will stop accepting further memory read requests(thereby stalling MC_(lgr)) and wait for deallocation of e entries andthen return the e entries to MC_(last), before accepting any furthermemory read requests.

FIGS. 20A and 20B show stalling of borrowing where MC₁ tries to borrowfrom MC₂ until T3_(lgr)+T4_(lgr) entries are free in MC_(lgr) upondeallocation of entries in MC_(lgr) (in this case, MC₂). Stalling theborrowing by memory clients can occur when the least growth rate memoryclient MC_(lgr) (in this case, MC₂) does not have T3_(lgr)+T4_(lgr)entries free and a borrower (in this case, MC₁) is requesting borrowingROB entries from MC_(lgr). MC_(lgr) will stop accepting further memoryread requests (thereby stalling MC_(lgr)) and wait for deallocation of eentries and then return the e entries to borrower (in this case, MC₁),before accepting any further memory read requests.

FIG. 21 depicts a process. The process can be used by a memory client,operating system (OS), driver, or memory controller to share re-orderbuffer memory resources among memory clients. At 2102, an allocation ofone or more entries in a reorder buffer is made to a memory client.Allocations can be made for multiple memory clients. Allocations can bemade based on priority of a memory client according to examplesdescribed herein. At 2104, for any received data that is to be stored inone or more entries of a reorder buffer, one or more entries of thereorder buffer can be allocated for use by the received data.

At 2106, a determination is made if a memory client has sufficiententries available in a reorder buffer to handle data received frommemory access requests. If the memory client's memory resources arebelow a threshold of available entries or the memory client has run outof entries, then 2108 can follow. Examples of a memory client's memoryresources being below a threshold of available entries or the memoryclient has run out of entries are described with respect to any of FIG.17, 18, 19A-19C, 20A, or 20B. If the memory client has sufficiententries, the process continues to 2104.

At 2108, if there are more memory access requests from a memory clientwhile waiting for deallocations from its allocated entries, a memoryclient can borrow one or more entries from another memory client. Forexample, the borrowed-from memory client can have some threshold numberof entries available and have a lowest growth rate of new entryallocations. One or more borrowed entries can be used to store datareceived from memory access requests. Examples of borrowing resourcesare described with respect to any of FIG. 17, 18, 19A-19C, 20A, or 20B.

At 2110, based on insufficient memory resources, a borrowed-from memoryclient can request one or more entries from another borrowed-from memoryclient. For example, once a last memory client in a chain exhausts itsentries and makes further memory access requests, the last memory clientcan request the least growth rate memory client to share one or moreentries and then use those one or more entries to store data from thememory access requests. If no entry is available to share, the lastmemory client in a chain can pause memory access requests until an entryis available in its reorder buffer or to be shared. Examples ofborrowing resources are described with respect to any of FIG. 17, 18,19A-19C, 20A, or 20B.

The appearances of the phrase “one example” or “an example” are notnecessarily all referring to the same example or embodiment. Any aspectdescribed herein can be combined with any other aspect or similar aspectdescribed herein, regardless of whether the aspects are described withrespect to the same figure or element.

Some examples may be described using the expression “coupled” and“connected” along with their derivatives. These terms are notnecessarily intended as synonyms for each other. For example,descriptions using the terms “connected” and/or “coupled” may indicatethat two or more elements are in direct physical or electrical contactwith each other. The term “coupled,” however, may also mean that two ormore elements are not in direct contact with each other, but yet stillco-operate or interact with each other.

The terms “first,” “second,” and the like, herein do not denote anyorder, quantity, or importance, but rather are used to distinguish oneelement from another. The terms “a” and “an” herein do not denote alimitation of quantity, but rather denote the presence of at least oneof the referenced items. The term “asserted” used herein with referenceto a signal denote a state of the signal, in which the signal is active,and which can be achieved by applying any logic level either logic 0 orlogic 1 to the signal. The terms “follow” or “after” can refer toimmediately following or following after some other event or events. Inflow diagrams, other sequences of steps may also be performed accordingto alternative embodiments. Furthermore, additional steps may be addedor removed depending on the particular applications. Any combination ofchanges can be used and one of ordinary skill in the art with thebenefit of this disclosure would understand the many variations,modifications, and alternative embodiments thereof.

Disjunctive language such as the phrase “at least one of X, Y, or Z,”unless specifically stated otherwise, is otherwise understood within thecontext as used in general to present that an item, term, etc., may beeither X, Y, or Z, or any combination thereof (e.g., X, Y, and/or Z).Thus, such disjunctive language is not generally intended to, and shouldnot, imply that certain embodiments require at least one of X, at leastone of Y, or at least one of Z to each be present. Additionally,conjunctive language such as the phrase “at least one of X, Y, and Z,”unless specifically stated otherwise, should also be understood to meanX, Y, Z, or any combination thereof, including “X, Y, and/or Z.”’

Embodiments of the invention may include various steps, which have beendescribed above. The steps may be embodied in machine-executableinstructions which may be used to cause a general-purpose orspecial-purpose processor to perform the steps. Alternatively, thesesteps may be performed by specific hardware components that containhardwired logic for performing the steps, or by any combination ofprogrammed computer components and custom hardware components.

As described herein, instructions may refer to specific configurationsof hardware such as application specific integrated circuits (ASICs)configured to perform certain operations or having a predeterminedfunctionality or software instructions stored in memory embodied in anon-transitory computer readable medium. Thus, the techniques shown inthe figures can be implemented using code and data stored and executedon one or more electronic devices (e.g., an end station, a networkelement, etc.). Such electronic devices store and communicate(internally and/or with other electronic devices over a network) codeand data using computer machine-readable media, such as non-transitorycomputer machine-readable storage media (e.g., magnetic disks; opticaldisks; random access memory; read only memory; flash memory devices;phase-change memory) and transitory computer machine-readablecommunication media (e.g., electrical, optical, acoustical or other formof propagated signals—such as carrier waves, infrared signals, digitalsignals, etc.).

In addition, such electronic devices typically include a set of one ormore processors coupled to one or more other components, such as one ormore storage devices (non-transitory machine-readable storage media),user input/output devices (e.g., a keyboard, a touchscreen, and/or adisplay), and network connections. The coupling of the set of processorsand other components is typically through one or more busses and bridges(also termed as bus controllers). The storage device and signalscarrying the network traffic respectively represent one or moremachine-readable storage media and machine-readable communication media.Thus, the storage device of a given electronic device typically storescode and/or data for execution on the set of one or more processors ofthat electronic device. Of course, one or more parts of an embodiment ofthe invention may be implemented using different combinations ofsoftware, firmware, and/or hardware. Throughout this detaileddescription, for the purposes of explanation, numerous specific detailswere set forth in order to provide a thorough understanding of thepresent invention. It will be apparent, however, to one skilled in theart that the invention may be practiced without some of these specificdetails. In certain instances, well known structures and functions werenot described in elaborate detail in order to avoid obscuring thesubject matter of the present invention. Accordingly, the scope andspirit of the invention should be judged in terms of the claims whichfollow.

Example 1 includes a graphics processing apparatus that includes: aninterface to a memory device; a reorder buffer system coupled to theinterface to the memory device, the reorder buffer system comprising arandom access memory and a tracker; and an interface to couple thereorder buffer system to a decompressor, wherein: the random accessmemory is to store data prior to output to the interface coupled to thedecompressor, the tracker is to cause data to be provided to theinterface to the decompressor in order of allocation, and an amount ofmemory resources in the random access memory allocated to reorderreceived data is configurable based on a mode of operation.

Example 2 includes any example, wherein the reorder buffer systemcomprises a control buffer to indicate compression characteristics ofdata stored in the memory device.

Example 3 includes any example, wherein the compression characteristicscomprise one or more of: compression state, surface format, compressionformat, and other metadata.

Example 4 includes any example, wherein the mode of operation is basedon a type of application requesting use of decompression.

Example 5 includes any example, wherein the type of applicationcomprises a game, presentation software, spreadsheet, or video player.

Example 6 includes any example, wherein the mode of operation is basedon an amount of clock cycles used to transfer compressed data at leastat a first compression ratio that involves multiple clock cycles totransfer data associated with a read request.

Example 7 includes any example, wherein the mode of operation is basedon hiding latency from use of the random access memory to store data forreorder of data.

Example 8 includes any example, wherein the random access memory is toallocate memory resources for a first client and memory resources for asecond client.

Example 9 includes any example, and including a controller that is topermit the first client to borrow memory resources from the secondclient.

Example 10 includes any example, wherein the second client has availablememory resources and an associated slowest growth rate for memoryallocation.

Example 11 includes any example, wherein the random access memory is toallocate memory resources for a third client and wherein the controlleris to allocate memory resources for the second client by a borrow ofmemory resources from the third client and the controller is to allocatememory resources for the first client by a borrow of memory resourcesfrom the second client.

Example 12 includes a method performed by a reorder buffer used by adecompressor to reorder compressed data entries, the method comprising:allocating one or more entries based on mode of operation for use inre-ordering received entries associated with a read request; storingreceived data associated with the read request into the allocated one ormore entries; based on receipt of an entry that has not been provided tothe decompressor and is a front of line, providing the entry in-order tothe decompressor; and based on identification of receipt of a last entryof all one or more entries associated with the read request, providingall one or more entries, not previously provided to the decompressor,in-order to the decompressor.

Example 13 includes any example, and includes: providing compressioninformation for one or more entries to the decompressor.

Example 14 includes any example, wherein the compression informationcomprises one or more of: compression state, surface format, compressionformat, and other metadata.

Example 15 includes any example, and includes: allocating memoryresources for storage of one or more entries based at least in part on atype of application requesting use of decompression or clock cycles usedto transfer compressed data being at least of a threshold size.

Example 16 includes any example, wherein the type of applicationcomprises a game, presentation software, spreadsheet, or video player.

Example 17 includes any example, and includes: allocating memoryresources for the decompressor and memory resources for another memoryclient.

Example 18 includes any example, and includes: permitting thedecompressor to borrow memory resources from the another memory client.

Example 19 includes any example, wherein the another memory client hasavailable memory resources and an associated slowest growth rate formemory allocation.

Example 20 includes a computer-readable medium comprising instructionsstored thereon, that if executed by a processor, causes the processorto: cause a random access memory to store data prior to output to theinterface coupled to a decompressor, cause received data to be providedto the interface to the decompressor in order of allocation, and modifyan amount of memory resources in the random access memory to reorderreceived data based on a mode of operation.

Example 21 includes any example, wherein the mode of operation is basedon a type of application requesting use of decompression.

Example 22 includes any example, wherein the type of applicationcomprises a game, presentation software, spreadsheet, or video player.

Example 23 includes any example, and includes instructions storedthereon, that if executed by a processor, causes the processor to:allocate memory resources for the decompressor and memory resources foranother memory client.

Example 24 includes any example, and includes instructions storedthereon, that if executed by a processor, causes the processor to:allocate memory resources to the decompressor from memory resourcesallocated to the another memory client.

Example 25 includes any example, and includes instructions storedthereon, that if executed by a processor, causes the processor to:provide compression information for one or more entries to thedecompressor, wherein the compression information comprises one or moreof: compression state, surface format, compression format, and othermetadata.

What is claimed is:
 1. A graphics processing apparatus comprising: aninterface to a memory device; circuitry coupled to the interface to thememory device, the circuitry comprising a memory and a second circuitry;third circuitry to allocate memory resources among multiple clients; andan interface to couple the circuitry to a decompressor, wherein: thethird circuitry is to allocate reorder buffer entries in the memory to afirst client and allocate reorder buffer entries in the memory to asecond client, the third circuitry is to re-allocate, to the firstclient, one or more reorder buffer entries allocated to the secondclient based on usage of memory resources by the second client, thememory is to store data in one or more reorder buffer entries prior tooutput to the interface coupled to the decompressor, and the secondcircuitry is to cause data to be provided to the interface to thedecompressor in order of allocation.
 2. The graphics processingapparatus of claim 1, wherein the circuitry comprises a control bufferto indicate compression characteristics of data stored in the memorydevice.
 3. The graphics processing apparatus of claim 2, wherein thecompression characteristics comprise one or more of: compression state,surface format, compression format, and other metadata.
 4. The graphicsprocessing apparatus of claim 1, wherein a mode of operation is based ona type of application requesting decompression of data stored in the oneor more reorder buffer entries.
 5. The graphics processing apparatus ofclaim 4, wherein the type of application comprises a game, presentationsoftware, spreadsheet, or video player.
 6. The graphics processingapparatus of claim 1, wherein an amount of memory resources in thememory allocated to reorder received data is configurable based on amode of operation and the mode of operation is based on an amount ofclock cycles used to transfer compressed data at least at a firstcompression ratio that involves multiple clock cycles to transfer dataassociated with a read request.
 7. The graphics processing apparatus ofclaim 1, wherein a mode of operation is based on hiding latency from useof the memory to store data for reorder of data.
 8. The graphicsprocessing apparatus of claim 1, wherein the second client has availablememory resources and an associated growth rate that is less than that ofthe first client.
 9. The graphics processing apparatus of claim 1,wherein the third circuitry is to allocate reorder buffer entries to athird client and wherein the third circuitry is to allocate reorderbuffer entries to the second client by a borrow of reorder bufferentries allocated to the third client and a controller is to allocatereorder buffer entries to the first client by a borrow of reorder bufferentries allocated to the second client.
 10. A method performed by areorder buffer used by a decompressor to reorder compressed dataentries, the method comprising: allocating one or more reorder bufferentries based on mode of operation for use in re-ordering receivedentries associated with a read request; storing received data associatedwith the read request into the allocated one or more reorder bufferentries; based on receipt of a reorder buffer entry that has not beenprovided to the decompressor and is a front of line, providing thereorder buffer entries in-order to the decompressor; based onidentification of receipt of a last entry of all one or more reorderbuffer entries associated with the read request, providing all one ormore reorder buffer entries, not previously provided to thedecompressor, in-order to the decompressor; allocating reorder bufferentries to a first client and a second client; and re-allocating, to thefirst client, one or more reorder buffer entries allocated to the secondclient based on usage of memory resources by the second client.
 11. Themethod of claim 10, further comprising: providing compressioninformation for one or more reorder buffer entries to the decompressor.12. The method of claim 11, wherein the compression informationcomprises one or more of: compression state, surface format, compressionformat, and other metadata.
 13. The method of claim 10, wherein theallocating reorder buffer entries to the first client and the secondclient is based at least in part on a type of application requesting useof decompression or clock cycles used to transfer compressed data. 14.The method of claim 13, wherein the type of application comprises agame, presentation software, spreadsheet, or video player.
 15. Themethod of claim 10, wherein the second client has available allocatedreorder buffer entries and re-allocating to the first client one or morereorder buffer entries allocated to the second client based on usage ofmemory resources by the second client is based on rate of memoryallocation to the second client.
 16. A non-transitory computer-readablemedium comprising instructions stored thereon, that if executed by atleast one processor, causes the at least one processor to: cause amemory to store data in one or more reorder buffer entries prior tooutput to an interface to a decompressor; cause received data from theone or more reorder buffer entries to be provided to the interface tothe decompressor in order of allocation; allocate reorder buffer entriesin the memory to a first client and to a second client; and re-allocate,to the first client, one or more reorder buffer entries allocated to thesecond client based on usage of memory resources by the second client.17. The non-transitory computer-readable medium of claim 16, wherein there-allocate, to the first client, one or more reorder buffer entriesallocated to the second client based on usage of memory resources by thesecond client is based on rate of memory allocation to the secondclient.
 18. The non-transitory computer-readable medium of claim 16,wherein the re-allocate, to the first client, one or more reorder bufferentries allocated to the second client based on usage of memoryresources by the second client is based on a mode of operation ofapplications associated with the first client and the second client. 19.The non-transitory computer-readable medium of claim 16, wherein a modeof operation of applications is based on a type of the applicationsrequesting decompression of data stored in the one or more reorderbuffer entries.
 20. The non-transitory computer-readable medium of claim19, wherein the type of the applications comprises a game, presentationsoftware, spreadsheet, or video player.